#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 1000000007;
vector<int>alpha[30];
string s;
int C[2005][2005];
int pre[2005][30];
signed main(){
	cin>>s;
	for(int i=s.length()-1;i>=0;i--){
		alpha[s[i]-'a'].push_back(i);
		pre[i][s[i]-'a']=1;
		for(int j=0;j<26;j++){
			pre[i][j]+=pre[i+1][j];
		}
	}
	for(int i=1;i<s.length();i++){
		C[i][0]=1;
		for(int j=1;j<i;j++){
			 C[i][j]=(C[i-1][j]+C[i-1][j-1])%maxn;
		}
		C[i][i]=1;
	}
	int q;
	cin>>q;
	while(q--){
		int l,sum=0;
		char a,b;
		cin>>l>>a>>b;
		for(int i=0;i<alpha[a-'a'].size();i++){
			if(alpha[a-'a'][i]>=l-2){
				int cnt=pre[alpha[a-'a'][i]+1][b-'a'];
				cnt=(cnt*C[alpha[a-'a'][i]][l-2])%maxn;
				sum=(sum+cnt)%maxn;
			}
		}
		cout<<sum<<endl;
	}
}