//什么时候我才能有杜爷一半强呀/kk
//烂烂 摆摆 呜呜
#include<cstdio>
#include<iostream>
#include<cstring>
#include<map>
using std::cin;
using std::cout;
using std::map;
const int N=233333;
int n;
char ch[N];
namespace sub1{
unsigned long long P=31;
int p[5050][5050],s[5050][5050];
unsigned long long pw[5050],h1[5050],h2[5050];
unsigned long long gsh(int l,int r){return h1[r]-h1[l-1]*pw[r-l+1];}
unsigned long long ghs(int l,int r){return h2[l]-h2[r+1]*pw[r-l+1];}
int mian(){
	pw[0]=1;
	for(int i=1;i<=n;i++){
		h1[i]=h1[i-1]*P+(ch[i]-'A'+1);
		pw[i]=pw[i-1]*P;
	}
	for(int i=n;i;i--)h2[i]=h2[i+1]*P+(ch[i]-'A'+1);
	for(int len=1;len<=n;len++){
		map<unsigned long long,int>mp;
		for(int l=1;l+len-1<=n;l++){
			int r=l+len-1;
			if(gsh(l,r)!=ghs(l,r))continue;
			s[l][r]++;int x=mp[gsh(l,r)];
			if(x)s[x][r]--;mp[gsh(l,r)]=l;
		}
	}
	for(int l=1;l<=n;l++)
		for(int r=l;r<=n;r++)
			s[l][r]+=s[l][r-1];
	for(int l=n;l;l--)
		for(int r=l;r<=n;r++)
			s[l][r]+=s[l+1][r];
	int m=0;cin>>m;
	for(int i=1;i<=m;i++){
		int l=0,r=0;cin>>l>>r;
		cout<<s[l][r]<<'\n';
	}
	return 0;
}
}
int main(){
	cin>>(ch+1);n=strlen(ch+1);
	if(n<=5000)return sub1::mian();
}