Description:

MZL's Circle Zhou is good at solving some counting problems. One day, he comes up with a counting problem:

You are given two strings a,b which consist of only lowercase English letters. You can subtract a substring x (maybe empty) from string a and a substring y (also maybe empty) from string b, and then connect them as x+y with x at the front and y at the back. In this way, a series of new strings can be obtained.

The question is how many different new strings can be obtained in this way.

Two strings are different, if and only if they have different lengths or there exists an integer i such that the two strings have different characters at position i.

Input:

The first line of the input is a single integer T (T≤5), indicating the number of testcases.

For each test case, there are two lines, the first line is string a, and the second line is string b. 1<=|a|,|b|<=90000.

For each test case, there are two lines, the first line is string a, and the second line is string b. 1<=|a|,|b|<=90000.

Output:

For each test case, output one line, a single integer indicating the answer.

Sample Input:

2 acbcc cccabc bbbabbababbababbaaaabbbbabbaaaabaabbabbabbbaaabaab abbaabbabbaaaabbbaababbabbabababaaaaabbaabbaabbaab

Sample Output:

135 557539

Source:

Submit