#include<iostream>
#include<vector>
using namespace std;

#define ll long long int
#define mod 1000000007

ll fact[100007];

ll vsum(vector<ll> v)
{
	ll i,ln = v.size(),sum = 0;
	for(i = 0;i<ln;i++)
	{
		sum += v[i];
	}
	return sum;
}

ll inverse(ll base)
{
	ll ans = 1;
	ll exp = mod-2;
	while(exp)
	{
		if(exp&1)
		{
			ans = (ans*base)%mod;
		}
		base = (base*base)%mod;
		exp = exp/2;
	}
	return ans;
}

int main()
{
	ll i,j,k,n,num,ans,lk;
	string s;
	cin>>s;
	fact[0] = 1;
	for(i = 1;i<100000;i++)
	{
		fact[i] = (i*fact[i-1])%mod;
	}
	ll ln = s.length();
	ll arr[ln+1][26];
	for(i = 0;i<26;i++)
	{
		arr[0][i] = 0;
	}
	j = s[0]-'a';
	arr[0][j] = 1;
	for(i = 1;i<ln;i++)
	{
		for(j = 0;j<26;j++)
		{
			arr[i][j] = arr[i-1][j];
		}
		k = s[i]-'a';
		arr[i][k]++;
	}
	int q;
	cin>>q;
	while(q--)
	{
		int l,r;
		cin>>l>>r;
		l--;
		r--;
		vector<ll> even,odd;
		if(l == 0)
		{
			for(j = 0;j<26;j++)
			{
				if(arr[r][j]>0&&arr[r][j]%2 == 0)
				{
					even.push_back(arr[r][j]);
				}
				else if(arr[r][j]%2 == 1)
				{
					odd.push_back(arr[r][j]);
				}
			}
		}
		else
		{
			for(j = 0;j<26;j++)
			{
				num = arr[r][j]-arr[l-1][j];
				if(num>0&&num%2 == 0)
				{
					even.push_back(num);
				}
				else if(num%2 == 1)
				{
					odd.push_back(num);
				}
			}
		}
		vector<ll> p;
		ll le = even.size();
		ll lo = odd.size();
		for(i = 0;i<le;i++)
		{
			p.push_back(even[i]/2);
		}
		for(i = 0;i<lo;i++)
		{
			if(odd[i]>1)
			p.push_back(odd[i]/2);
		}
		ans = fact[vsum(p)];
		lk = p.size();
		ll prod = 1;
		for(i = 0;i<lk;i++)
		{
			prod = (prod*((fact[p[i]])))%mod;
		}
		ans = (ans*inverse(prod))%mod;
		if(lo>1)
		ans = (ans*lo)%mod;
		cout<<ans<<"\n";
	}
}