Two lowercase words are anagrams if one can be rearranged into the other, i.e. they contain exactly the same letters with the same multiplicities.
Given two words, decide whether they are anagrams of each other.
Input format
Line 1: the first word a.
Line 2: the second word b.
Output format
Print YES if a and b are anagrams, otherwise NO.
Constraints
- 1 <= len(a), len(b) <= 100000
- Both words consist of lowercase English letters.