//作者:1085422276

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

//#include<bits/stdc++.h>

#include <map>

#include <stack>

typedef long long ll;

using namespace std;

const int inf = ;

inline ll read()

{

    ll x=,f=;

    char ch=getchar();

    while(ch<''||ch>'')

    {

        if(ch=='-')f=-;

        ch=getchar();

    }

    while(ch>=''&&ch<='')

    {

        x=x*+ch-'';

        ch=getchar();

    }

    return x*f;

}

ll exgcd(ll a,ll b,ll &x,ll &y)

{

    ll temp,p;

    if(b==)

    {

        x=;

        y=;

        return a;

    }

    p=exgcd(b,a%b,x,y);

    temp=x;

    x=y;

    y=temp-(a/b)*y;

    return p;

}

//*******************************

int p[];

int main()

{

   int T;

   scanf("%d",&T);

    while(T--)

    {

        string a,b;

        cin>>b>>a;

        a=" "+a;

        b=" "+b;

        int m=b.length();

        int n=a.length();

        n--,m--;

        memset(p,,sizeof(p));

        int j=;

        for(int i=;i<=m;i++)

        {

            while(j>&&b[j+]!=b[i])j=p[j];

            if(b[j+]==b[i])j++;

            p[i]=j;

        }

        int ans=;

        j=;

        for(int i=;i<=n;i++)

        {

            while(j>&&b[j+]!=a[i])j=p[j];

            if(b[j+]==a[i])j++;

             if(j==m){

                ans++;

             }

        }

        cout<<ans<<endl;

    }

    return ;

}