BETA

Difficulty Level:

Easy

Total Submissions: 180 Accuracy:

48.89%

Find number of times a string occurs as a subsequence
     

Given two strings S1 and S2, find the number of times the second string occurs in the first string, whether continuous or discontinuous.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains integers N and M denoting the length of the strings S1 and S2 respectively.

The second line of each test case contains the strings S1 and S2.

Output:

Print the number of times S2 appears in S1, whether continuous or discontinuous. Print the answer for each test case in a new line.


Constraints:

1<= T <=100

1<= N, M <=1000


Example:

Input:

1

13 3

geeksforgeeks gks

Output: 

4

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.