#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int C = 26, M = 1000000000;
  string x, y; cin >> x >> y;
  const int x_len = x.length(), y_len = y.length();
  vector<int> sum_x[C]{}, sum_y[C]{};
  REP(i, C) {
    sum_x[i].resize(x_len);
    REP(j, x_len) sum_x[i][j] = (x[j] == 'a' + i) + (j > 0 ? sum_x[i][j - 1] : 0);
  }
  REP(i, C) {
    sum_y[i].resize(y_len);
    REP(j, y_len) sum_y[i][j] = (y[j] == 'a' + i) + (j > 0 ? sum_y[i][j - 1] : 0);
  }
  vector<ll> len{0, x_len};
  while (len.back() < M) {
    ll f_n = len.back();
    len.emplace_back(f_n * 2 + y_len);
  }
  auto f = [&](auto&& f, int l, int r, int level, int c) -> int {
    if (l == 0 && r + 1 == len[level]) {
      return (1 << (level - 1)) * sum_x[c].back() + ((1 << (level - 1)) - 1) * sum_y[c].back();
    }
    if (level == 1) return sum_x[c][r] - (l > 0 ? sum_x[c][l - 1] : 0);
    const int sl = len[level - 1], sr = sl + y_len;
    if (r < sl) return f(f, l, r, level - 1, c);
    if (l >= sr) return f(f, len[level - 1] - 1 - (r - sr), len[level - 1] - 1 - (l - sr), level - 1, c);
    if (sl <= l && r < sr) return sum_y[c][r - sl] - (l > sl ? sum_y[c][l - sl - 1] : 0);
    if (r < sr) return f(f, l, sl - 1, level - 1, c) + sum_y[c][r - sl];
    if (l >= sl) {
      return f(f, len[level - 1] - 1 - (r - sr), len[level - 1] - 1, level - 1, c) +
             sum_y[c].back() - (l > sl ? sum_y[c][l - sl - 1] : 0);
    }
    return f(f, l, sl - 1, level - 1, c) +
           sum_y[c].back() +
           f(f, len[level - 1] - 1 - (r - sr), len[level - 1] - 1, level - 1, c);
  };
  int q; cin >> q;
  while (q--) {
    int l, r; char c; cin >> l >> r >> c; --l; --r;
    cout << f(f, l, r, len.size() - 1, c - 'a') << '\n';
  }
  return 0;
}