#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

string s,t;
int spre[100001][26],tpre[100001][26],ssuf[100001][26],tsuf[100001][26];
vector<ll> sz;
//[1,i]のid+'a'の個数
int calc(int i,int id){
  if(i==0)return 0;
  int M=s.size()+t.size();
  int ans=i/M*(spre[s.size()][id]+tpre[t.size()][id]);
  if(i%M<=int(s.size())){
    //sが残る(or何も残らない)
    if(i/M%2==0){
      //sはそのまま
      return ans+spre[i%M][id];
    }else{
      //sはreverse
      return ans+ssuf[i%M][id];
    }
  }
  int L=i/M*M+s.size()+1,R=i;
  ans+=ssuf[s.size()][id];
  assert(L<=R);
  //tのどっち向きか分からんけど[L,R]番目の個数
  for(int i=sz.size()-1;i>0;--i){
    debug(L,R);
    if(sz[i-1]<L&&R<sz[i]){
      if(L==sz[i-1]+1){
        //tはそのまま
        return ans+tpre[R-L+1][id];
      }else if(R==sz[i-1]+int(t.size())){
        //tはreverse
        return ans+tsuf[R-L+1][id];
      }else{
        //対称位置に移動
        const pair<int,int> nxt(sz[i]+1-L,sz[i]+1-R);
        R=nxt.first;
        L=nxt.second;
      }
    }
  }
  assert(false);
  return 0;
}
int main(){
  // startupcpp();
  cin>>s>>t;
  sz.emplace_back(s.size());
  while(sz.back()<mod)sz.emplace_back(sz.back()*2+t.size());
  for(size_t i=0;i<s.size();++i){
    spre[i+1][s[i]-'a']++;
    ssuf[i+1][s[s.size()-i-1]-'a']++;
    for(int j=0;j<26;++j){
      spre[i+1][j]+=spre[i][j];
      ssuf[i+1][j]+=ssuf[i][j];
    }
  }
  for(size_t i=0;i<t.size();++i){
    tpre[i+1][t[i]-'a']++;
    tsuf[i+1][t[t.size()-i-1]-'a']++;
    for(int j=0;j<26;++j){
      tpre[i+1][j]+=tpre[i][j];
      tsuf[i+1][j]+=tsuf[i][j];
    }
  }
  int Q;
  cin>>Q;
  while(Q--){
    int L,R;
    char c;
    cin>>L>>R>>c;
    int ans1=calc(R,c-'a');
    debug(ans1);
    int ans2=calc(L-1,c-'a');
    debug(ans2);
    print(ans1-ans2);
  }
}