#include<cstdio>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<cctype>

#include<cstdlib>

#include<vector>

#include<queue>

#include<map>

#include<set>

#define ll unsigned long long

#define R register int

using namespace std;

namespace Fread {

    //static char B[1<<15],*S=B,*D=B;

    //#define getchar() (S==D&&(D=(S=B)+fread(B,1,1<<15,stdin),S==D)?EOF:*S++)

    inline int g() {

        R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

        do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

    }

}using Fread::g;

const int N=,B=;

ll h1[N],h2[N],p[N]; int n,l1,l2,t;

char s1[N],s2[N];

inline ll H1(int l,int r) {return h1[r]-h1[l-]*p[r-l+];}

inline ll H2(int l,int r) {return h2[r]-h2[l-]*p[r-l+];}

inline int ck(int x) {

    R i=x,j=; R l=,r=l2+;

    for(R k=;k<=;++k) {

        while(l<r) { R md=l+r>>;

            if(H1(i,i+md-)==H2(j,j+md-)) l=md+; else r=md;

        } i+=l,j+=l;

        l=,r=l2-j+;

        if(k==) {if(j->=l2) return ;}

        else if(j->=l2) return ;

    } return ;

}

signed main() {

#ifdef JACK

    freopen("NOIPAK++.in","r",stdin);

#endif

    p[]=; for(R i=;i<=N-;++i) p[i]=p[i-]*B;

    t=g(); while(t--) { R ans=;

        scanf("%s%s",s1+,s2+); l1=strlen(s1+),l2=strlen(s2+);

        if(l1<l2) {printf("0\n"); continue;}

        for(R i=;i<=l1;++i) h1[i]=h1[i-]*B+s1[i];

        for(R i=;i<=l2;++i) h2[i]=h2[i-]*B+s2[i];

        for(R i=;i<=l1-l2+;++i) ans+=ck(i); printf("%d\n",ans);

    }

}