#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <algorithm>
#include <iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 500009 ;
int c[N] ;
int n ;
//int p[220009] ;
char a[1000009] ;
char b[10009];


void getnext(char *b,int *next)
{
    int len = strlen(b);
    int j = 0,k = -1 ;
    next[0] = -1 ;
    while(j < len)//查找多次且可重叠时len不能减一，因为该单词的末尾加一的next也需要被下一次查询用到。
    {
        if(k == -1 || b[k] == b[j])
        {
            k++;
            j++;
            // 下面nest数组的优化
            if(b[k] != b[j])
                next[j] = k ;
            else
                next[j] = next[k];
        }
        else
        {
            k = next[k];
        }
    }
}

int main()
{
    int n ;
    scanf("%d",&n);
    while(n--)
    {
        int next[10009];
        scanf("%s",b);
        scanf("%s",a);
        int lena = strlen(a),lenb = strlen(b);
        getnext(b,next);
        int i = 0,j = 0;
        int ans = 0 ;
        while(i < lena)
        {
            if(j == -1 || a[i] == b[j])
            {
                i++ ;
                j++ ;
            }
            else
            {
                j = next[j];
            }
            if(j == lenb)
            {
                ans++;
                j = next[j] ;
            }
        }
        printf("%dn",ans);
    }



    return 0 ;
}