#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#include<vector>
#define pb push_back
using namespace std;
int const xn=1e5+5;
int n,m,tax[xn],tp[xn],sa[xn],rk[xn],sta[xn],top,dc[xn],ht[xn][20],bin[20],r[xn],ans[xn];
char s[xn];
vector<int>v[xn],com[xn];
set<int>st;
set<int>::iterator it;
struct N{int l,r,id;}q[xn];
bool cmp(N x,N y){return x.r<y.r;}
int rd()
{int ret=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=0; ch=getchar();}while(ch>='0'&&ch<='9')ret=ret*10+ch-'0',ch=getchar();return f?ret:-ret;
}
void Rsort()
{for(int i=1;i<=m;i++)tax[i]=0;for(int i=1;i<=n;i++)tax[rk[tp[i]]]++;for(int i=1;i<=m;i++)tax[i]+=tax[i-1];for(int i=n;i;i--)sa[tax[rk[tp[i]]]--]=tp[i];
}
void work()
{for(int i=1;i<=n;i++)rk[i]=s[i],tp[i]=i;Rsort();for(int k=1;k<=n;k<<=1){int num=0;for(int i=n-k+1;i<=n;i++)tp[++num]=i;for(int i=1;i<=n;i++)if(sa[i]>k)tp[++num]=sa[i]-k;Rsort(); swap(rk,tp);rk[sa[1]]=1; num=1;for(int i=2;i<=n;i++)rk[sa[i]]=(tp[sa[i]]==tp[sa[i-1]]&&tp[sa[i]+k]==tp[sa[i-1]+k])?num:++num;if(num==n)break;m=num;}
}
void get()
{int k=0;for(int i=1;i<=n;i++){if(rk[i]==1)continue;if(k)k--; int j=sa[rk[i]-1];while(i+k<=n&&j+k<=n&&s[i+k]==s[j+k])k++;ht[rk[i]][0]=k;}bin[0]=1; for(int i=1;i<20;i++)bin[i]=(bin[i-1]<<1);r[1]=0; for(int i=2;i<=n;i++)r[i]=r[i>>1]+1;for(int j=1;j<20;j++)for(int i=1;i<=n&&i+bin[j]-1<=n;i++)ht[i][j]=min(ht[i][j-1],ht[i+bin[j-1]][j-1]);//
}
int getlcp(int x,int y)
{if(x==y)return n;x=rk[x]; y=rk[y];if(x>y)swap(x,y); x++;int w=r[y-x+1];return min(ht[x][w],ht[y-bin[w]+1][w]);//
}
int main()
{scanf("%s",s+1); n=strlen(s+1);for(int i=1;i<=n;i++)dc[i]=(int)s[i];sort(dc+1,dc+n+1); m=unique(dc+1,dc+n+1)-dc-1;for(int i=1;i<=n;i++)s[i]=lower_bound(dc+1,dc+m+1,(int)s[i])-dc;work(); get();int Q=rd();for(int i=1;i<=Q;i++)q[i].l=rd(),q[i].r=rd(),q[i].id=i;sort(q+1,q+Q+1,cmp); int p=0;for(int i=1;i<=Q;i++){while(p<q[i].r){p++; int y;while(rk[y=sta[top]]<rk[p]&&top)//<
        {int pos=min(n+1,p+getlcp(y,p));v[pos].pb(y); com[p].pb(y);top--;}sta[++top]=p; st.insert(p);for(int i=0,x;i<v[p].size();i++)if(st.count(x=v[p][i])){for(int j=0;j<com[x].size();j++)if(st.count(com[x][j]))st.erase(com[x][j]);st.erase(x);}}it=st.lower_bound(q[i].l);ans[q[i].id]=*it;}for(int i=1;i<=Q;i++)printf("%d\n",ans[i]);return 0;
}