#include<cstdio>

 #include<vector>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int N=;

 int trs[N][],fth[N],len[N],vis[N],ori[N];

 int T,t1,t2,lth,tot,lst,cnt,tmp,tep;

 char str[N]; vector<int> vec;

 int Insert(int ch)

 {

     int nde=lst,newn=++tot;

     lst=newn,len[newn]=len[nde]+;

     while(nde&&!trs[nde][ch])

         trs[nde][ch]=newn,nde=fth[nde];

     if(!nde) fth[newn]=;

     else

     {

         int tran=trs[nde][ch];

         if(len[tran]==len[nde]+)

             fth[newn]=tran;

         else

         {

             int rnde=++tot;

             len[rnde]=len[nde]+,ori[rnde]=ori[tran];

             for(int i=;i<=;i++) trs[rnde][i]=trs[tran][i];

             fth[rnde]=fth[tran],fth[tran]=fth[newn]=rnde;

             while(nde&&trs[nde][ch]==tran)

                 trs[nde][ch]=rnde,nde=fth[nde];

         }

     }

     return newn;

 }

 void Clean()

 {

     for(int i=;i<(int)vec.size();i++)

     {

         int nde=vec[i];

         while(nde&&vis[nde])

             vis[nde]=false,nde=fth[nde];

     }

 }

 int main()

 {

     scanf("%s%d",str+,&T);

     lst=tot=,lth=strlen(str+);

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

         ori[Insert(str[i]-'a')]=true;

     while(T--)

     {

         scanf("%s%d%d",str+,&t1,&t2);

         vec.clear(),lst=,lth=strlen(str+);

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

             vec.push_back(Insert(str[i]-'a'));

         long long ans=,anss=;

         for(int i=;i<(int)vec.size();i++)

         {

             int nde=vec[i];

             while(nde&&!vis[nde])

             {

                 ans+=len[nde]-len[fth[nde]];

                 if(ori[nde]) anss+=len[nde]-len[fth[nde]];

                 vis[nde]=true,nde=fth[nde];

             }

         }

         printf("%lld\n",ans-anss),Clean();

     }

     return ;

 }