Problems
Anagrams
Anagrams
The word is an anagram of another word, if it can be obtained by rearrangement of its letters.
\InputFile
Two words are given in different lines. The words consist of lowercase letters and digits. The lengths of each word is no more than $100$.
\OutputFile
Print "\textbf{YES}" if the words are anagrams of each other and "\textbf{NO}" otherwise.
Input example #1
sharm marsh
Output example #1
YES
Input example #2
ananas nnaass
Output example #2
NO