Description
Enola's mom leaves Enola a secrete encrypted message! The message seems to be a nonsense combination of lower case alphabets. However, clever Enola soon finds out that the message can be decrypted into a meaningful vocabulary by rearranging the positions of the alphabets. Enola comes up with a vocabulary, can you tell her whether the message can be decrypted into her vocabulary?
Input
The input consists of multiple test case, terminated with EOF (end of file).
On the first line of the test case are two integers n and m, being the length of the encrypted message and the length of a vocabulary.
On the next line are two strings a and b, being the encrypted message and a vocabulary.
-
1 <= n, m <= 1000
-
a, b only contains lower case alphabets (i.e. a-z).
Output
For each test case, if a can be decrypted into b by rearranging the positions of alphabets, print "YES" in one line, otherwise print "NO".