#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=a;i<=b;i++)
#define Fod(i,b,a) for (int i=b;i>=a;i--)
using namespace std;
typedef long long LL;
LL read(){LL x=0,f=0;char ch=getchar();while (!isdigit(ch))f|=ch=='-',ch=getchar();while (isdigit(ch))x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return f?-x:x;
}
const int N=200005*2;
int n,Q;
int pnode[N];
char s[N];
vector <int> id;
namespace Mseg{const int S=N*25;int ls[S],rs[S],size;void Init(){size=0,clr(ls),clr(rs);}void Ins(int &rt,int L,int R,int x){if (!rt)rt=++size;if (L==R)return;int mid=(L+R)>>1;if (x<=mid)Ins(ls[rt],L,mid,x);elseIns(rs[rt],mid+1,R,x);}int Merge(int a,int b,int L,int R){if (!a||!b)return a+b;int rt=++size;if (L<R){int mid=(L+R)>>1;ls[rt]=Merge(ls[a],ls[b],L,mid);rs[rt]=Merge(rs[a],rs[b],mid+1,R);}return rt;}void GetR(int rt,int L,int R,vector <int> &v){if (!rt)return;if (L==R)return (void)v.push_back(L);int mid=(L+R)>>1;GetR(ls[rt],L,mid,v);GetR(rs[rt],mid+1,R,v);}int Getpre(int rt,int L,int R,int xR){// <xRif (!rt||L>=xR)return 0;if (L==R)return L;int mid=(L+R)>>1,v=Getpre(rs[rt],mid+1,R,xR);if (v)return v;elsereturn Getpre(ls[rt],L,mid,xR);}
}
namespace SAM{struct Node{int Next[26],fa,Max,pos;}t[N];int last,root,size;int rt[N],id[N];void Init(){clr(t),Mseg::Init();last=root=size=1;}void extend(int c,int ps){int p=last,np=++size,q,nq;t[np].Max=t[p].Max+1,t[np].pos=ps,pnode[ps]=np;Mseg::Ins(rt[np],1,n,ps);for (;p&&!t[p].Next[c];p=t[p].fa)t[p].Next[c]=np;if (!p)t[np].fa=1;else {q=t[p].Next[c];if (t[p].Max+1==t[q].Max)t[np].fa=q;else {nq=++size;t[nq]=t[q],t[nq].Max=t[p].Max+1,t[nq].pos=ps;t[np].fa=t[q].fa=nq;for (;p&&t[p].Next[c]==q;p=t[p].fa)t[p].Next[c]=nq;}}last=np;}void Sort(){static int tax[N];clr(tax);For(i,1,size)tax[t[i].Max]++;For(i,1,size)tax[i]+=tax[i-1];For(i,1,size)id[tax[t[i].Max]--]=i;}void build(){Sort();Fod(i,size,2){int x=id[i],f=t[x].fa;rt[f]=Mseg::Merge(rt[f],rt[x],1,n);}}
}
using SAM::t;
vector <int> e[N],qs[N];
int fa[N][20],son[N],size[N],top[N],aI[N],Time;
void dfs(int x){fa[x][0]=t[x].fa,size[x]=1,son[x]=0;For(i,1,19)fa[x][i]=fa[fa[x][i-1]][i-1];for (auto y : e[x]){dfs(y);size[x]+=size[y];if (!son[x]||size[y]>size[son[x]])son[x]=y;}
}
void Get_Top(int x,int Top){top[x]=Top,aI[++Time]=x;if (son[x])Get_Top(son[x],Top);for (auto y : e[x])if (y!=son[x])Get_Top(y,y);
}
struct que{int L,R,ans;que(){}que(int _L,int _R){L=_L,R=_R;}
}q[N];
void ins_q(int L,int R,int id){int x=pnode[R];Fod(i,19,0)if (L+t[fa[x][i]].Max-1>=R)x=fa[x][i];q[id].ans=max(q[id].ans,Mseg::Getpre(SAM::rt[x],1,n,R));x=fa[x][0];while (x){q[id].ans=max(q[id].ans,Mseg::Getpre(SAM::rt[x],1,n,L+t[x].Max));assert(L+t[x].Max<=R);qs[x].push_back(id),x=fa[top[x]][0];}
}
namespace Seg{const int S=N*2*4;int ls[N],rs[N],Max[N],size;void Init(){while (size)ls[size]=rs[size]=Max[size]=0,size--;}void Ins(int &rt,int L,int R,int x,int v){if (!rt)rt=++size;Max[rt]=max(Max[rt],v);if (L==R)return;int mid=(L+R)>>1;if (x<=mid)Ins(ls[rt],L,mid,x,v);elseIns(rs[rt],mid+1,R,x,v);}int Query(int rt,int L,int R,int xL,int xR){if (!rt||L>xR||R<xL)return 0;if (xL<=L&&R<=xR)return Max[rt];int mid=(L+R)>>1;return max(Query(ls[rt],L,mid,xL,xR) ,Query(rs[rt],mid+1,R,xL,xR));}
}
void solve(){int sz=SAM::size,root;For(i,1,sz){if (i==1||!son[aI[i-1]])Seg::Init(),root=0;int x=aI[i];for (auto j : qs[x])q[j].ans=max(q[j].ans,Seg::Query(root,1,n,1,q[j].L));id.clear(),id.push_back(t[x].pos);for (auto y : e[x])if (y!=son[x])Mseg::GetR(SAM::rt[y],1,n,id);for (auto y : id)Seg::Ins(root,1,n,y-t[x].Max+1,y);}
}
int main(){scanf("%s",s+1),n=strlen(s+1);SAM::Init();For(i,1,n)SAM::extend(s[i]-'a',i);SAM::build();For(i,2,SAM::size)e[t[i].fa].push_back(i);dfs(1),Time=0,Get_Top(1,1),Q=read();For(i,1,Q){q[i].L=read(),q[i].R=read(),q[i].ans=0;ins_q(q[i].L,q[i].R,i);}solve();For(i,1,Q)printf("%d\n",max(0,q[i].ans-q[i].L+1));return 0;
}