#include <bits/stdc++.h>
#include <bits/extc++.h>
#define sz(a) (ll)a.size()
#define pb push_back
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ull=unsigned long long;
using db=double;
const ll N=200005;
const db alpha=0.4;
const ull B=19260817;
ll n,q,sz[N],z1[N],z2[N],lcp1[N],lcp2[N],ans[N];
char a[2][N],b[N];
string c[N];
vector<ll> id[N];
ull h[2][N],pB[N],hc[N];
ull calh(ll l,ll r,ll op){
	return h[op][r]-h[op][l-1]*pB[r-l+1];
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	rep(i,0,1){
		string s;
		cin>>s;
		n=s.length();
		rep(j,1,n){
			a[i][j]=s[j-1];
			h[i][j]=h[i][j-1]*B+a[i][j];
		}
	}
	pB[0]=1;
	rep(i,1,n){
		pB[i]=pB[i-1]*B;
	}
	cin>>q;
	rep(i,1,q){
		cin>>c[i];
		sz[i]=c[i].length();
		id[sz[i]].pb(i);
		for(char j:c[i]){
			hc[i]=hc[i]*B+j;
		}
	}
	rep(i,2,n){
		if(sz(id[i])>alpha*i){
			gp_hash_table<ull,ll> cnth;
			rep(j,1,n-i+1){
				rep(k,j,j+i-2){
					cnth[calh(j,k,0)*pB[i-(k-j+1)]+calh(k+1,j+i-1,1)]++;
				}
			}
			for(ll j:id[i]){
				ans[j]=cnth[hc[j]];
			}
		}
	}
	rep(i,1,q){
		if(sz[i]==1||sz[i]>n){
			cout<<0<<'\n';
		}
		else if(sz(id[sz[i]])>alpha*sz[i]){
			cout<<ans[i]<<'\n';
		}
		else{
			rep(j,1,sz[i]){
				b[j]=c[i][j-1];
			}
			for(ll j=2,l=1,r=0;j<=sz[i];j++){
				z1[j]=0;
				if(j<=r){
					z1[j]=min(r-j+1,z1[j-l+1]);
				}
				while(j+z1[j]<=sz[i]&&b[j+z1[j]]==b[z1[j]+1]){
					z1[j]++;
				}
				if(j+z1[j]-1>r){
					l=j;
					r=j+z1[j]-1;
				}
			}
			for(ll j=sz[i]-1,l=sz[i]+1,r=sz[i];j>=1;j--){
				z2[j]=0;
				if(j>=l){
					z2[j]=min(j-l+1,z2[sz[i]-(r-j+1)+1]);
				}
				while(j-z2[j]>=1&&b[j-z2[j]]==b[sz[i]-z2[j]]){
					z2[j]++;
				}
				if(j-z2[j]+1<l){
					l=j-z2[j]+1;
					r=j;
				}
			}
			for(ll j=1,l=1,r=0;j<=n;j++){
				lcp1[j]=0;
				if(j<=r){
					lcp1[j]=min(r-j+1,z1[j-l+1]);
				}
				while(j+lcp1[j]<=n&&lcp1[j]+1<=sz[i]&&a[0][j+lcp1[j]]==b[lcp1[j]+1]){
					lcp1[j]++;
				}
				if(j+lcp1[j]-1>r){
					l=j;
					r=j+lcp1[j]-1;
				}
			}
			for(ll j=n,l=n+1,r=n;j>=1;j--){
				lcp2[j]=0;
				if(j>=l){
					lcp2[j]=min(j-l+1,z2[sz[i]-(r-j+1)+1]);
				}
				while(j-lcp2[j]>=1&&sz[i]-lcp2[j]>=1&&a[1][j-lcp2[j]]==b[sz[i]-lcp2[j]]){
					lcp2[j]++;
				}
				if(j-lcp2[j]+1<l){
					l=j-lcp2[j]+1;
					r=j;
				}
			}
			ll ans=0;
			rep(j,1,n-sz[i]+1){
				ll k=j+sz[i]-1;
				ans+=max(0ll,j+lcp1[j]-1-(k-lcp2[k]+1)+(lcp1[j]<sz[i])+(lcp2[k]<sz[i]));
			}
			cout<<ans<<'\n';
		}
	}
	return 0;
}