**Problem E**

**Distinct
Subsequences**

**Input: **standard input

**Output: **standard output

A subsequence of a given sequence
is just the given sequence with some elements (possibly none) left out.
Formally, given a sequence *X***=**
** x_{1}x_{2}…x_{m}**, another sequence

In this problem
your job is to write a program that counts the number of occurrences of ** Z**
in

** **

**Input**

The first line of the input
contains an integer ** N** indicating the number of test cases to follow.

The first line
of each test case contains a string ** X**, composed entirely of lowercase
alphabetic characters and having length no greater than 10,000. The second line
contains another string

** **

**Output**

For each test case in the input
output the number of distinct occurrences of ** Z** in

** **

**Sample Input**

babgbag

bag

rabbbit

rabbit

** **

**Sample Output**

3

Rezaul Alam Chowdhury