Question
Concat Palindrome
Ninu has two strings A and B of lengths N and M respectively. Ninu can rearrange both strings in any way she wants. Let the rearranged string of A be A′ and the rearranged string of B be B′. Determine whether she can construct rearrangements A′ and B′ such that (A′ + B′) is a palindrome.
Here + denotes the concatenation operation. For e.g. abc + xyz = abcxyz.
Note: A string is called palindrome if it reads the same backwards and forwards, for e.g. noon and level are palindromic strings.
Input
The first line contains a single integer T - the number of test cases. Then the test cases follow.
The first line of each test case contains two integers N and M - the length of the strings A and B respectively.
The second line of each test case contains a string A of length N containing lowercase Latin letters only.
The third line of each test case contains a string B of length M containing lowercase Latin letters only.
Constraints
1 ≤ T ≤ 105
1 ≤ N, M ≤ 105
A and B consist of lowercase Latin letters only.
Note: Sum of N + M over all test cases does not exceed 2x105.
The first line of each test case contains two integers N and M - the length of the strings A and B respectively.
The second line of each test case contains a string A of length N containing lowercase Latin letters only.
The third line of each test case contains a string B of length M containing lowercase Latin letters only.
Constraints
1 ≤ T ≤ 105
1 ≤ N, M ≤ 105
A and B consist of lowercase Latin letters only.
Note: Sum of N + M over all test cases does not exceed 2x105.
Output
For each test case, output Yes if we can rearrange A and B such that (A′ + B′) becomes a palindrome. Otherwise, output No.
Example
Sample Input
2
5 2
abcdd
ac
3 3
abc
xyz
Sample Output
Yes
No
Explanation
Test case 1: We can rearrange A to A' = acdbd and B to B' = ca. so A' + B' = acdbdca which is palindromic.
Test case 2: We can not rearrange A and B such that A' + B′ is palindromic.
2
5 2
abcdd
ac
3 3
abc
xyz
Sample Output
Yes
No
Explanation
Test case 1: We can rearrange A to A' = acdbd and B to B' = ca. so A' + B' = acdbdca which is palindromic.
Test case 2: We can not rearrange A and B such that A' + B′ is palindromic.