#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
string x,y;
int nx, ny;
vector<ll> siz;
vector<vector<ll>> num;
vector<vector<ll>> cntx, cnty;
int search(int til, int d, int c){
    //cout << til << " " << d << " " << c << endl;
    int res;
    if(til > siz[d+1]) res = search(til, d+1, c);
    else if(til > siz[d] + ny) res = num[d+1][c] - search(siz[d+1]-til, d, c);
    else if(til > siz[d]) res = num[d][c] + cnty[til-siz[d]][c];
    else{
        if(d) res = search(til, d-1, c);
        else res = cntx[til][c];
    }
    return res;
}
int main(){
    int q;
    cin >> x >> y >> q;
    nx = x.size(), ny = y.size();
    ll tot = nx;
    vector<ll> cnt(26,0), cnt2(26,0);
    cntx.push_back(cnt); cnty.push_back(cnt2);
    rep(i,nx){
        cnt[x[i]-'a']++;
        cntx.push_back(cnt);
        //rep(i,26) cout << cnt[i] << " ";
        //cout << endl;
    }
    rep(i,ny){
        cnt2[y[i]-'a']++;
        cnty.push_back(cnt2);
        //rep(i,26) cout << cnt2[i] << " ";
        //cout << endl;
    }
    siz.push_back(tot); num.push_back(cnt);
    while(tot < MOD){
        tot = tot * 2 + ny;
        rep(i,26) cnt[i] = cnt[i] * 2 + cnt2[i];
        siz.push_back(tot); num.push_back(cnt);
    }
    //cout << "a" << endl;
    rep(queryqueryqueryqueryquery,q){
        int l,r; char a;
        cin >> l >> r >> a;
        cout << search(r,0,a-'a') - search(l-1,0,a-'a') << endl;
    }
    cout << ny << endl;
    return 0;
}