#include<stdio.h>
#include<string.h>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<ctype.h>
#include<stack>
#include<math.h>
#include <string>
#include<algorithm>
using namespace std;
typedef unsigned long long ULL;
const int maxn=10000;
const int maxm=10000000;
int next[maxn];
void getnext(string pattern, int len)
{
int k=-1;
next[0]=-1;
for(int i=1;i<len;i++)
{
while(k>-1&&pattern[k+1]!=pattern[i]) k=next[k];
if(pattern[k+1]==pattern[i])
k++;
next[i]=k;
}
}
int kmp(string pattern,int plen,string target,int tlen)
{
int k=-1;
int cnt=0;
for(int i=0;i<tlen;i++)
{
while(k>-1&&pattern[k+1]!=target[i]) k=next[k];
if(pattern[k+1]==target[i])
k++;
if(k==plen-1)
cnt++,k=next[k];
}
return cnt;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t;
string pattern,target;
cin>>t;
while(t--)
{
cin>>pattern>>target;
getnext(pattern,pattern.size());
cout<<kmp(pattern,pattern.size(),target,target.size())<<endl;
}
return 0;
}
#include<iostream>
#include<stdio.h>
using namespace std;
int next[10005];
void get_next(string T)
{
int j=-1;
int i=0;
next[0]=-1;
while(i<T.size())
{
if(j==-1||T[i]==T[j])
{
i++;
j++;
if(T[i]!=T[j])
next[i]=j;
else
next[i]=next[j];
}
else
j=next[j];
}
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
string t;
string s;
int n;
cin>>n;
int cnt=0;
while(n--)
{
cin>>t>>s;
get_next(t);
cnt=0;
int i=0,j=0;
while(i<s.size())
{
if(j==-1||t[j]==s[i])
{
i++;
j++;
}
else
j=next[j];
if(j==t.size())
{
cnt++;
j=next[j];
}
}
cout<<cnt<<endl;
}
return 0;
}