Two phrases are anagrams if one can be turned into the other by rearranging its letters. Characters that are not letters - spaces and punctuation - are ignored completely.
Your task is to check, for each given pair of phrases, whether they are anagrams.
Input
First line of input will be a single integer - the number of testcases.
Each testcase consists of two lines, one phrase per line. The phrases are made of lowercase English letters, spaces and punctuation marks (such as . , ! ? ' -).
Output
For every testcase print YES if the two phrases are anagrams, and NO otherwise.
Example
2 panta redovno zakasni neopravdan izostanak oni su skrsili vagu suvisni kilogrami
YES NO
In the first testcase both phrases use exactly the letters of "neopravdan izostanak". In the second the letter counts differ.
Constraints
Each line has at most characters.
This problem was adapted, with permission, from Anagram, authored by Društvo matematičara Srbije and Fondacija Petlja.