#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define int ll
#define lll __int128
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
#define pb emplace_back
const int N=5e5+7;
vector<pii>q[N];
int n,ans[N];
string T[N];
namespace SAM
{
	const int N=3e6+7;
	signed ch[N][26],TOT;
	inline void INS(string &s)
	{
		reverse(s.begin(),s.end());
		signed x=0;
		for(auto c:s)
		{
			if(!ch[x][c-'a'])ch[x][c-'a']=++TOT;
			x=ch[x][c-'a'];
		}
	}
	signed d[N][26],fa[N],len[N],sfx[N],nd[N],tot=1;
	inline void ins(int id,int c,int x)
	{
		int p=++tot;
		len[p]=len[x]+1,nd[sfx[p]=id]=p;
		for(;x&&!d[x][c];x=fa[x])d[x][c]=p;
		int y=d[x][c];
		if(!y)fa[p]=1;
		else if(len[y]==len[x]+1)fa[p]=y;
		else
		{
			int z=++tot;
			memcpy(d[z],d[y],sizeof(d[z]));
			len[z]=len[x]+1;
			fa[z]=fa[y],fa[y]=fa[p]=z;
			for(;d[x][c]==y;x=fa[x])d[x][c]=z;
		}
	}
	inline void build()
	{
		queue<int>q;
		q.push(0);nd[0]=1;
		while(!q.empty())
		{
			int x=q.front();
			q.pop();
			for(int c=0;c<26;c++)
			{
				int y=ch[x][c];if(!y)continue;
				ins(y,c,nd[x]);q.push(y);
			}
		}
	}
	struct edge
	{
		int to,nxt;
	}e[N];
	int etot,h[N];
	inline void eadd(int x,int y)
	{
		e[++etot].to=y;
		e[etot].nxt=h[x];
		h[x]=etot;
	}
	#define FOR(x) for(int i=h[x],y;y=e[i].to,i;i=e[i].nxt)
	signed siz[N],son[N];
	inline bool cmax(int &x,int y){return x<y?x=y,1:0;}
	inline bool cmin(int &x,int y){return x>y?x=y,1:0;}
	void dfs1(int x)
	{
		siz[x]=1;int mx=-1;
		FOR(x)
		{
			dfs1(y);
			if(cmax(mx,siz[y]))son[x]=y;
		}
	}
	signed top[N],dfn[N],idfn[N],dcnt;
	void dfs2(int x,int topn)
	{
		dfn[x]=++dcnt,idfn[dcnt]=x;
		top[x]=topn;if(!son[x])return;
		dfs2(son[x],topn);
		FOR(x)if(y!=son[x])dfs2(y,y);
	}
	int tag[N<<2],C[N],L;
	#define ls p<<1
	#define rs p<<1|1
	inline void Build()
	{
		for(L=1;L<=dcnt+1;L<<=1);
		for(int i=1;i<=dcnt;i++)C[i]=len[idfn[i]]-1;
		for(int i=1;i<=L+dcnt;i++)tag[i]=n+1;
	}
	inline int query(int x)
	{
		int tg=n+1,c=C[x];x+=L;
		while(x)cmin(tg,tag[x]),x>>=1;
		//cout<<tg<<endl;
		return c+tg;
	}
	inline void col(int l,int r,int c)
	{
		for(int p=l+L-1,q=r+L+1;p^q^1;p>>=1,q>>=1)
		{
			if(~p&1)tag[p^1]=c;
			if(q&1)tag[q^1]=c;
		}
	}
	inline int lca(int x,int y)
	{
		while(top[x]!=top[y])
		{
			if(dfn[x]<dfn[y])swap(x,y);
			x=fa[top[x]];
		}
		return dfn[x]<dfn[y]?x:y;
	}
	inline void ref(int x,int c)
	{
		while(x)
		{
			col(dfn[top[x]],dfn[x],c);
			x=fa[top[x]];
		}
	}
	inline int find(int l,int r,int v)
	{
		int ans;
		while(l<=r)
		{
			int mid=l+r>>1;
			if(query(mid)>v)r=mid-1,ans=mid;
			else l=mid+1;
		}
		return ans;
	}
	inline int ask(int x,int r)
	{
		//cout<<x<<" "<<r<<endl;
		int y=-1,ans=len[x];
		while(x)
		{
			if(query(dfn[x])<=r)break;
			y=x,x=fa[top[x]];
		}
		if(y==-1)return 0;
		y=find(dfn[top[y]],dfn[y],r);//the last x,val[x]>r
		int v=query(y);//cout<<idfn[y]<<"|"<<v<<"|"<<len[idfn[y]]<<endl;
		y=idfn[y];
		if(v-len[y]+len[fa[y]]>=r)ans-=len[fa[y]];
		else ans-=len[y]+r-v;
		return ans;
	}
	inline void MAIN()
	{
		build();
		for(int i=2;i<=tot;i++)eadd(fa[i],i);
		dfs1(1),dfs2(1,1);
		Build();
		for(int i=1;i<=n;i++)
		{
			int l=n-i+1;
			ref(nd[i],l);
			for(auto Q:q[l])
			{
				int r=Q.fi,id=Q.se;
				signed x=0;
				vector<int>v;
				for(auto c:T[id])
				{
					x=ch[x][c-'a'];
					v.pb(nd[x]);
				}
				sort(v.begin(),v.end(),[](int x,int y){return dfn[x]<dfn[y];});
				for(int i=0;i<v.size();i++)
				{
					ans[id]+=ask(v[i],r);//return;
					if(i)ans[id]-=ask(lca(v[i-1],v[i]),r);
				}
				//cout<<endl;
			}
		}
	}
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	string s;cin>>s;SAM::INS(s);
	n=s.size();
	int m;cin>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>T[i];
		SAM::INS(T[i]);
		int l,r;
		cin>>l>>r;
		q[l].pb(r,i);
	}
	SAM::MAIN();
	for(int i=1;i<=m;i++)cout<<ans[i]<<"\n";
	return 0;
}