The first line consist only one integer N, indicates N cases follows. In each case, there are two lines, the first line gives the string A, length (A) <= 10, and the second line gives the string B, length (B) <= 1000. And it is guaranteed that B is always longer than A.
For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A.
3 11 1001110110 101 110010010010001 1010 110100010101011
3 0 3