#include<bits/stdc++.h>

 #define pa pair<int,int>

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define MP make_pair

 using namespace std;

 typedef long long ll;

 const int maxn=1e6+;

 inline char gc(){

     return getchar();

     static const int maxs=<<;static char buf[maxs],*p1=buf,*p2=buf;

     return p1==p2&&(p2=(p1=buf)+fread(buf,,maxs,stdin),p1==p2)?EOF:*p1++;

 }

 inline ll rd(){

     ll x=;char c=gc();bool neg=;

     while(c<''||c>''){if(c=='-') neg=;c=gc();}

     while(c>=''&&c<='') x=(x<<)+(x<<)+c-'',c=gc();

     return neg?(~x+):x;

 }

 struct SAM{

     int len[maxn*],fa[maxn*],tr[maxn*][],pct,lst,pos[maxn*];

     inline void clear(){

         while(pct){

             CLR(tr[pct],);

             len[pct]=fa[pct]=pos[pct]=;

             pct--;

         }pct=lst=;

     }

     inline void insert(int x,bool b){

         int p=++pct;

         len[p]=len[lst]+;pos[p]=len[p];

         int o=lst;lst=p;

         for(;o&&!tr[o][x];o=fa[o]) tr[o][x]=p;

         if(!o){fa[p]=;return;}

         int q=tr[o][x];

         if(len[q]==len[o]+){fa[p]=q;return;}

         int qq=++pct;if(b) pos[qq]=pos[p];

         len[qq]=len[o]+;fa[qq]=fa[q];

         memcpy(tr[qq],tr[q],sizeof(tr[q]));

         fa[q]=fa[p]=qq;

         for(;o&&tr[o][x]==q;o=fa[o]) tr[o][x]=qq;

     }

 }S,T;

 char s[maxn];

 int N,M,Q;

 int ill[maxn];

 int cnt[maxn],rnk[maxn],dfn[maxn][],id[maxn],tot;

 vector<int> eg[maxn];

 inline void dfs(int x){

     id[++tot]=x;dfn[x][]=tot;

     for(int i=;i<eg[x].size();i++) dfs(eg[x][i]);

     dfn[x][]=tot;

 }

 int rt[maxn],num[maxn*],ch[maxn*][],pct;

 inline void insert(int pre,int &p,int l,int r,int x,int y){

     p=++pct;num[p]=num[pre]+y;

     if(l<r){

         int m=l+r>>;

         if(x<=m) insert(ch[pre][],ch[p][],l,m,x,y),ch[p][]=ch[pre][];

         else insert(ch[pre][],ch[p][],m+,r,x,y),ch[p][]=ch[pre][];

     }

 }

 inline int query(int pre,int p,int l,int r,int x,int y){

     if(x>y) return ;

     if(x<=l&&r<=y) return num[p]-num[pre];

     int m=l+r>>,re=;

     if(x<=m) re=query(ch[pre][],ch[p][],l,m,x,y);

     if(y>=m+) re+=query(ch[pre][],ch[p][],m+,r,x,y);

     return re;

 }

 int main(){

     //freopen("","r",stdin);

     int i,j,k;

     scanf("%s",s+);N=strlen(s+);

     S.clear();

     for(i=;i<=N;i++) S.insert(s[i]-'a',);

     for(i=;i<=S.pct;i++) eg[S.fa[i]].push_back(i);

     dfs();

     for(i=;i<=tot;i++){

         if(S.pos[id[i]]) insert(rt[i-],rt[i],,N,S.pos[id[i]],);

         else rt[i]=rt[i-];

     }

     Q=rd();

     for(i=;i<=Q;i++){

         scanf("%s",s+);M=strlen(s+);

         int l=rd(),r=rd();

         int now=,nl=;

         for(j=;j<=M;j++){

             int x=s[j]-'a';

             while(now&&!(S.tr[now][x]&&query(rt[dfn[S.tr[now][x]][]-],rt[dfn[S.tr[now][x]][]],,N,l+nl,r))){

                 if(!nl){now=;break;}

                 nl--;

                 if(nl==S.len[S.fa[now]]) now=S.fa[now];

             }

             if(now) nl++,now=S.tr[now][x];

             else now=;

             ill[j]=nl;

             // printf("~%d %d\n",j,ill[j]);

         }

         T.clear();

         for(j=;j<=M;j++) T.insert(s[j]-'a',);

         ll ans=;

         for(j=;j<=T.pct;j++){

             ans+=max(,T.len[j]-max(T.len[T.fa[j]],ill[T.pos[j]]));

         }

         printf("%lld\n",ans);

     }

     return ;

 }