#include<cstdio>
#include<iostream>
#include<cstring>
#define int long long
#define maxn 200010
using namespace std;

char s[maxn];
int ans,strt;
int len,m,l,r,fail[maxn],nex[maxn][21];
int qe[maxn],qa[maxn],qs[maxn],qy[maxn],tmpi,tmpj;
int tote,tota,tots,toty;
template<typename T>void read(T &x)
{
	x=0;char c=getchar();T neg=0;
	while(!isdigit(c))neg|=!(c^'-'),c=getchar();
	while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
	if(neg)x=(~x)+1;
}
template<typename T>void wr(T x)
{
	if(x<0)putchar('-'),x=-x;
	if(x>9)wr(x/10);
	putchar((x-x/10*10)^48);
	return ;
}
signed main()
{
	freopen("easier.in","r",stdin);
	freopen("easier.out","w",stdout);
	scanf("%s",s+1);
	len=strlen(s+1);
	for(int i=1;i<=len;i++) 
	{
		if(s[i]=='e') qe[++tote]=i;
		if(s[i]=='a') qa[++tota]=i;
		if(s[i]=='s') qs[++tots]=i;
		if(s[i]=='y') qy[++toty]=i;
		
	}
	int i,j;
	i=j=1; while(i<=tote&&j<=tota){if(qe[i]<qa[j]) {nex[qe[i]][0]=qa[j],i++;continue;}else j++;}
	i=j=1; while(i<=tota&&j<=tots){if(qa[i]<qs[j]) {nex[qa[i]][0]=qs[j],i++;continue;}else j++;}
	i=j=1; while(i<=tots&&j<=toty){if(qs[i]<qy[j]) {nex[qs[i]][0]=qy[j],i++;continue;}else j++;}
	i=j=1; while(i<=toty&&j<=tote){if(qy[i]<qe[j]) {nex[qy[i]][0]=qe[j],i++;continue;}else j++;}
//  eesaseyaesasyy eeeaaasssyyy
	nex[len+1][0]=len+1;
	
	for(int j=1;j<=17;j++)
	{
		for(int i=1;i<=len+1;i++)
		{
			if(!nex[i][0]) nex[i][0]=len+1;
			nex[i][j]=nex[nex[i][j-1]][j-1]?nex[nex[i][j-1]][j-1]:len+1;
		}
			
	}
	scanf("%lld",&m);
	for(int i=1;i<=m;i++)
	{
		read(l); read(r);
		while(s[l]!='e') l++;
		int num=0;
		int st=l;
		for(int j=17;j>=0;j--) 
		{
			if(nex[st][j]<=r) 
			{
				st=nex[st][j];
				num+=(1<<j);
			}
			if(st==r) break;
		}
		wr((num+1)/4); putchar('\n');
	}
	return 0;
}
/*
eaeasyesasyea

eeeeyeeeeassssy

eeaseyaesasyy 
4
1 13 
2 12 
2 10 
3 11

eeeaaasssyyy
3
1 12 
2 12
1 11
*/