#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
using namespace std;
char a[1000005],b[10005];
int p[1000005];
int main(int argc, const char * argv[])
{
int i,j,m,n;
int T;
cin>>T;
while (T--)
{
scanf("%s%s",b+1,a+1);
n=strlen(a+1);
m=strlen(b+1);
p[1]=0;
j=0;
int ans=0;
for (i=2;i<=m;i++)
{
while (j>0&&b[j+1]!=b[i]) j=p[j];
if (b[j+1]==b[i]) j++;
p[i]=j;
}
j=0;
for (i=1;i<=n;i++)
{
while (j>0&&b[j+1]!=a[i]) j=p[j];
if (b[j+1]==a[i]) j++;
if (j==m)
{
ans++;//匹配位置是i-m+1
j=p[j];
}
}
printf("%d\n",ans);
}
return 0;
}