Problem of the day
If ‘STONES’ is “abAAc” and JEWELS is “Acd”.The number of jewels Ninja have is 3.
The first line of the input contains an integer, 'T,’ denoting the number of test cases.
The first line of each test case contains two integers, ‘N’ denoting the number of stones and M denoting the number of Jewels.
The second line of each test case contains an string of size N denoting ‘STONES’
The third line of each test case contains an string of size M denoting ‘JEWELS’
For each test case, print an single integer denoting the number of jewels Ninja found in the treasure box.
Print the output of each test case in a separate line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10000.
1 <= M <= 52
Time Limit = 1 sec
2
5 3
abAAc
Acd
4 2
acbd
Aa
3
1
For the first test case,
Ninja has 3 jewels, one ‘c’ and two ‘A’.Hence, the answer is 3.
For the second test case:
Ninja has only 1 jewel, one ‘a’.Hence, the answer is 1.
2
3 1
aaa
b
4 2
abcd
Bb
0
1