#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	string S,T;
	cin>>S>>T;
	int N=S.size(),M=T.size();
	rep(i,N) S+=S[N-i-1];
	rep(i,M) T+=T[M-i-1];
	int V=26;
	vector<vector<int>> dp1(V,vector<int>(N*2+1)),dp2(V,vector<int>(M*2+1));
	rep(j,V) rep(i,N*2){
		dp1[j][i+1]=dp1[j][i];
		if(S[i]-'a'==j) dp1[j][i+1]++;
	}
	rep(j,V) rep(i,M*2){
		dp2[j][i+1]=dp2[j][i];
		if(T[i]-'a'==j) dp2[j][i+1]++;
	}
	int Q;
	cin>>Q;
	rep(roop,Q){
		int L,R,A;
		cin>>L>>R;
		char c;
		cin>>c;
		int a=c-'a';
		L--;
		vector<int> p={R,L};
		int ans=0;
		rep(i,2){
			int tmp=0;
			ll l=p[i]+M;
			A=N*(l/(M+N))+max(0ll,l%(N+M)-M);
			tmp+=(A/(2*N))*dp1[a][N*2]+dp1[a][A%(2*N)];
			ll x=N+M;
			while(A){
				l=p[i]+x;
				A=M*(l/(x*2))+max(0ll,l%(x*2)-x*2+M);
				tmp+=(A/(2*M))*dp2[a][M*2]+dp2[a][A%(2*M)];
				x*=2;
			}
			if(i==0) ans+=tmp;
			else ans-=tmp;
		}
		cout<<ans<<"\n";
	}
}