#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
#define rep(i,a) for(i=first[a];i;i=next[i])
using namespace std;
const int maxn=100007;
int i,j,k,l,t,n,m,ans;
int p[maxn],f[maxn][21],deep[maxn];
int first[maxn*2],next[maxn*2],last[maxn*2],num;
char s[maxn];
void add(int x,int y){
last[++num]=y;next[num]=first[x];first[x]=num;
}
void dfs(int x,int y){
int i;
deep[x]=deep[y]+1;f[x][0]=y;
rep(i,x){
if(last[i]!=y){
dfs(last[i],x);
}
}
}
int lca(int x,int y){
int i;if(deep[x]<deep[y])swap(x,y);
fod(i,20,0)if(deep[f[x][i]]>deep[y])x=f[x][i];
if(deep[x]!=deep[y])x=f[x][0];
fod(i,20,0)if(f[x][i]!=f[y][i])x=f[x][i],y=f[y][i];
if(x!=y)return f[x][0];return x;
}
int main(){
scanf("%s",s+1);n=strlen(s+1);
fo(i,2,n){
while(j&&s[j+1]!=s[i])j=p[j];
if(s[j+1]==s[i])j++;
add(j,i);
p[i]=j;
// f[j][0]=i;
}
add(0,1);
dfs(0,0);
fo(j,1,20)fo(i,1,n)f[i][j]=f[f[i][j-1]][j-1];
scanf("%d",&m);
fo(i,1,m){
scanf("%d%d",&k,&l);
t=lca(k,l);
printf("%d %d\n",deep[t]-1,t);
}
}