#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<VB>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
using VP = vector<P>;
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n; i >= 0; i--)
#define per2(i,s,n) for(ll i = n; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define lb lower_bound
#define ub upper_bound
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}
template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<endl;}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

int main() {
  string x, y;
  ll q;
  cin >> x >> y >> q;
  ll xs = x.size(), ys = y.size();
  VV numx(xs,V(26)), numy(ys,V(26));
  rep(i,xs) {
    numx[i][x[i]-'a'] = 1;
    if(!i) continue;
    rep(j,26) numx[i][j] += numx[i-1][j];
  }
  rep(i,ys) {
    numy[i][y[i]-'a'] = 1;
    if(!i) continue;
    rep(j,26) numy[i][j] += numy[i-1][j];
  }
  
  auto check = [&](auto f, ll a) -> bool {
    ll i = xs;
    while(i < a) i = i*2+ys;
    if(i == a) return 0;
    return !f(f,i-a-ys);
  };
  
  rep(i,q) {
    ll l, r;
    char c;
    cin >> l >> r >> c;
    l--;
    ll sum = numx[xs-1][c-'a']+numy[ys-1][c-'a'];
    ll ansl = l/(xs+ys)*sum, ansr = r/(xs+ys)*sum;
    ll lex = l%(xs+ys), rex = r%(xs+ys);
    rep(j,2) {
      swap(l,r), swap(ansl,ansr), swap(lex,rex);
      if(!l) continue;
      if(lex) {
        if(lex <= xs) ansl += (l/(xs+ys)%2 ? numx[xs-1][c-'a']-numx[xs-lex-1][c-'a'] : numx[lex-1][c-'a']);
        else {
          ansl += numx[xs-1][c-'a'];
          lex -= xs;
          ansl += (check(check,l-lex) ? numy[ys-1][c-'a']-numy[ys-lex-1][c-'a'] : numy[lex-1][c-'a']);
        }
      }
    }
    cout << ansr-ansl << endl;
  }
}