This task is very simple.You are given two string A and B and you have to find how many times you can form string B from string A. You are only allow to delete some character from string A and Change postion of characters .You are not allow to use same index character of A two times in the same string to form string B.

For example :- string A = aba and string B=ab, so we can form 2 string from A same as B two string are different if atleast one place you use differently indexed character from A.

Input

First line of input will have no. test cases (T) and each test case contain two strings A and B .

Output

Number of time string B can form from A. Output become large so take module with 10⁹+7.

Constraints

1<=T<=100

1<= |A| , |B| <=10⁶

String consist only lowercase letters 'a' to 'z'