Problem Statement:
Two strings are considered anagrams of each other if they have the same characters (but maybe in different order). For example the strings "bacdc" and "dcbac" are anagrams, while the strings "bacdc" and "dcbad" are not.

Given two strings, you should find out the minimum number of characters deletions required to make the two strings anagrams. Any character can be deleted from any of the strings.


Input Format:
Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 ≤ T ≤ 100). Followed by the test cases, each test case is on two lines. Each line contains one of the strings. Both strings are at least 1 and at most 10,000 lower case English letters (from 'a' to 'z').


Output Format:
For each test case, print a single line which contains a single integer representing the minimum number of character deletions.


Sample Input:
2 cde abc abc cba


Sample Output:
4 0


Notes:
In the first test case, we need to delete 4 characters to make both strings anagrams, 'd' and 'e' from the first string and 'b' and 'a' from the second string.





Added by: feras_kassar
Added at: 2014-07-26 09:00:04 UTC
Time Limit: 3 seconds
Partial score: No
Source:Damascus University First Training Contest 2014