Anagram Checker

You are given a list of string pairs. For each pair, determine whether the two strings are anagrams of each other. Two strings are anagrams if they have exactly the same characters in any order. Formally, given two strings \( s_1 \) and \( s_2 \), they are anagrams if and only if \( sorted(s_1) = sorted(s_2) \).

The input will start with an integer \( T \) representing the number of pairs. Then, for each pair, two strings are provided separated by whitespace. For each pair, print "Yes" if they are anagrams and "No" otherwise.

Example:

Input:
3
listen silent
triangle integral
apple pale
Output:
Yes
Yes
No

</p>

inputFormat

The first line of input contains a single integer \( T \) denoting the number of string pairs. Each of the following \( T \) lines contains two non-empty strings separated by space.

outputFormat

For each test case, output a line containing "Yes" if the two strings are anagrams of each other; otherwise, output "No".

## sample

3
listen silent
triangle integral
apple pale

Yes
Yes
No

</p>