#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
void chmax(ll&a,ll b){a=max(a,b);}
signed main(){
  string X,Y;ll Q;
  cin>>X>>Y>>Q;
  ll N=X.size(),M=Y.size();
  vector<vector<ll>>dpx(26,vector<ll>(N+1)),dpy(26,vector<ll>(M+1));
  REP(i,N){
    REP(j,26)dpx[j][i+1]=dpx[j][i];
    dpx[X[i]-'a'][i+1]++;
  }
  REP(i,M){
    REP(j,26)dpy[j][i+1]=dpy[j][i];
    dpy[Y[i]-'a'][i+1]++;
  }
  REP(i,Q){
    ll L,R;char C;cin>>L>>R>>C;L--;
    ll x=L/(N+M)*(dpx[C-'a'][N]+dpy[C-'a'][M]),y=R/(N+M)*(dpx[C-'a'][N]+dpy[C-'a'][M]);
    if(L%(N+M)<N){
      if(L/(N+M)%2)x+=dpx[C-'a'][N]-dpx[C-'a'][N-L%(N+M)];
      else x+=dpx[C-'a'][L%(N+M)];
    }
    else{
      x+=dpx[C-'a'][N];
      ll t=L/(N+M);bool p=0;
      while(1){
        ll s=1;
        while(2*s-1<=t)s*=2;
        if(s-1==t)break;
        p=!p;t=2*(s-1)-t;
      }
      if(p)x+=dpy[C-'a'][M]-dpy[C-'a'][N+M-L%(N+M)];
      else x+=dpy[C-'a'][L%(N+M)-N];
    }
    if(R%(N+M)<N){
      if(R/(N+M)%2)y+=dpx[C-'a'][N]-dpx[C-'a'][N-R%(N+M)];
      else y+=dpx[C-'a'][R%(N+M)];
    }
    else{
      y+=dpx[C-'a'][N];
      ll t=R/(N+M);bool p=0;
      while(1){
        ll s=1;
        while(2*s-1<=t)s*=2;
        if(s-1==t)break;
        p=!p;t=2*(s-1)-t;
      }
      if(p)y+=dpy[C-'a'][M]-dpy[C-'a'][N+M-R%(N+M)];
      else y+=dpy[C-'a'][R%(N+M)-N];
    }
    //cout<<y<<" "<<x<<endl;
    cout<<y-x<<endl;
  }
  return 0;
}