#include #define rep(i, l, r) for (int i = (l); i < (r); i++) using namespace std; typedef long long ll; int main() { string X, Y; int Q; cin >> X >> Y >> Q; int M = X.size(), N = Y.size(); vector> XC(26, vector(M + 1, 0)), YC(26, vector(N + 1, 0)); rep(i, 0, M) { rep(j, 0, 26) XC[j][i + 1] = XC[j][i]; XC[X[i] - 'a'][i + 1]++; } rep(i, 0, N) { rep(j, 0, 26) YC[j][i + 1] = YC[j][i]; YC[Y[i] - 'a'][i + 1]++; } vector L(Q), R(Q); vector C(Q); rep(i, 0, Q) cin >> L[i] >> R[i] >> C[i]; rep(i, 0, Q) { int a = (L[i] - 1) / (M + N), b = (L[i] - 1) % (M + N); int c0 = (XC[C[i] - 'a'][M] + YC[C[i] - 'a'][N]) * a; if (b <= M) { if (a % 2) { c0 += XC[C[i] - 'a'][M] - XC[C[i] - 'a'][M - b]; } else { c0 += XC[C[i] - 'a'][b]; } } else { c0 += XC[C[i] - 'a'][M]; int idx = a + 1; while (idx % 2 == 0) idx /= 2; if (idx % 4 == 3) { c0 += YC[C[i] - 'a'][N] - YC[C[i] - 'a'][N - b + M]; } else { c0 += YC[C[i] - 'a'][b - M]; } } a = R[i] / (M + N), b = R[i] % (M + N); int c1 = (XC[C[i] - 'a'][M] + YC[C[i] - 'a'][N]) * a; if (b <= M) { if (a % 2) { c1 += XC[C[i] - 'a'][M] - XC[C[i] - 'a'][M - b]; } else { c1 += XC[C[i] - 'a'][b]; } } else { c1 += XC[C[i] - 'a'][M]; int idx = a + 1; while (idx % 2 == 0) idx /= 2; if (idx % 4 == 3) { c1 += YC[C[i] - 'a'][N] - YC[C[i] - 'a'][N - b + M]; } else { c1 += YC[C[i] - 'a'][b - M]; } } cout << c1 - c0 << endl; } }