The word is an anagram of another word, if it can be obtained by rearrangement of its letters.

   Input

Two words are given in different lines. The words consist of lowercase letters. The lengths of each word is no more than 20000 and not less than 1.

   Output

    Print "YES" if the words are anagrams of each other and "NO" otherwise.