Two words are anagrams if one can be rearranged into the other. Read two lowercase words and print YES if they are anagrams, otherwise NO.
Input
Two lines, each a lowercase word of up to 10^5 letters.
Output
YES or NO.
Read from standard input and write to standard output. 5 test cases in total (3 hidden). Tests for this language run inside your browser.