Given two strings S and A . Print "1" if both strings are anagrams otherwise print "0" .

Input: First line of input contains a single integer T which denotes the number of test cases. T test cases follows, first line of each test case contains a string S. Second and last line of each test case consists of string A.

Output: Corresponding to each test case, print the required output.

Constraints:

1<=T<=100
1<= length(S and A) <=1000

Example:

Input:
2
cdbkdub
dsbkcsdn
geeks
skgee

Output:
0
1

** For More Input/Output Examples Use 'Expected Output' option **