#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
int main(){
  string s,t;cin >> s >> t;
  ll n=s.size(),m=t.size();
  vvl dp(n+1,vl(26));
  vvl ep(m+1,vl(26));
  rep(i,n){
    rep(j,26){
      dp[i+1][j]+=dp[i][j];
    }
    dp[i+1][s[i]-'a']++;
  }
  rep(i,m){
    rep(j,26){
      ep[i+1][j]+=ep[i][j];
    }
    ep[i+1][t[i]-'a']++;
  }
  ll q;cin >> q;
  while(q--){
    ll l,r;char x;cin >> l >> r >> x;l--;
    ll t=x-'a';
    auto dfs=[&](auto &self, ll d,ll right){
      if(d==0){
        return dp[right][t];
      }
      ll len=(1LL<<(d-1))*(n+m)-m;
      ll nowlen=(1<<d)*(n+m)-m;
      if(right<len){
        return self(self,d-1,right);
      }
      else if(right<len+m){
        return (dp[n][t]<<(d-1))+(ep[m][t]<<(d-1))-ep[m][t]+ep[right-len][t];
      }
      else{
        return (dp[n][t]<<d)+(ep[m][t]<<d)-ep[m][t]-self(self,d-1,nowlen-right);
      }
    };
    cout << dfs(dfs,32,r)-dfs(dfs,32,l) << endl;
  }
}