#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

int rec(int x) {
    int t = 31 - __builtin_clz(x);
    int y = x - (1 << t);
    if (y == 0) return 0;
    return rec((1 << t) - y) ^ 1;
}

int main() {
    string X, Y;
    cin >> X >> Y;

    ll N = sz(X), M = sz(Y);

    vector<vector<ll>> c1(26, vector<ll>(N + 1, 0)), c2(26, vector<ll>(N + 1, 0));
    vector<vector<ll>> d1(26, vector<ll>(M + 1, 0)), d2(26, vector<ll>(M + 1, 0));

    rep(i, N) {
        rep(j, 26) {
            c1[j][i + 1] = c1[j][i];
            c2[j][i + 1] = c2[j][i];
        }
        c1[X[i] - 'a'][i + 1]++;
        c2[X[N - 1 - i] - 'a'][i + 1]++;
    }
    rep(i, M) {
        rep(j, 26) {
            d1[j][i + 1] = d1[j][i];
            d2[j][i + 1] = d2[j][i];
        }
        d1[Y[i] - 'a'][i + 1]++;
        d2[Y[M - 1 - i] - 'a'][i + 1]++;
    }

    vector<int> sgn(32, 0);
    rep2(i, 1, 4) {
        int j = (1 << i) - 1;
        rep(k, j) sgn[2 * j - k] = sgn[k] ^ 1;
    }

    int Q;
    cin >> Q;

    while (Q--) {
        int l, r;
        cin >> l >> r;
        l--;

        char c;
        cin >> c;
        int x = c - 'a';

        ll sl = 0, sr = 0;
        {
            int K = l / (N + M);
            sl += c1[x][N] * K + d1[x][M] * K;
            sl += (K & 1 ? c2 : c1)[x][min(N, l % (N + M))];
            sl += (rec(K + 1) ? d2 : d2)[x][max(0LL, l % (N + M) - N)];
        }
        {
            int K = r / (N + M);
            sr += c1[x][N] * K + d1[x][M] * K;
            sr += (K & 1 ? c2 : c1)[x][min(N, r % (N + M))];
            sr += (rec(K + 1) ? d2 : d2)[x][max(0LL, r % (N + M) - N)];
        }

        cout << sr - sl << '\n';
    }
}