#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1 << 20;
struct CD {
  double r, i;
  CD(double r = 0, double i = 0) : r(r), i(i) {}
  double real() const { return r; }
  void operator/=(const int c) { r /= c, i /= c; }
};
CD operator*(const CD& a, const CD& b) {
  return CD(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r);
}
CD operator+(const CD& a, const CD& b) { return CD(a.r + b.r, a.i + b.i); }
CD operator-(const CD& a, const CD& b) { return CD(a.r - b.r, a.i - b.i); }
const double pi = acos(-1.0);
CD cp1[MAXN + 9], cp2[MAXN + 9];
int R[MAXN + 9];
void dft(CD* a, int n, bool inv) {
  for (int i = 0, ThxDem = n; i < ThxDem; ++i)
    if (R[i] < i) swap(a[R[i]], a[i]);
  for (int m = 2; m <= n; m *= 2) {
    double z = 2 * pi / m * (inv ? -1 : 1);
    CD wi = CD(cos(z), sin(z));
    for (int j = 0; j < n; j += m) {
      CD w(1);
      for (int k = j, k2 = j + m / 2; k2 < j + m; k++, k2++) {
        CD u = a[k];
        CD v = a[k2] * w;
        a[k] = u + v;
        a[k2] = u - v;
        w = w * wi;
      }
    }
  }
  if (inv)
    for (int i = 0, ThxDem = n; i < ThxDem; ++i) a[i] /= n;
}
vector<int> multiply(vector<int>& p1, vector<int>& p2) {
  int n = p1.size() + p2.size() + 1;
  int m = 1, cnt = 0;
  while (m <= n) m += m, cnt++;
  for (int i = 0, ThxDem = m; i < ThxDem; ++i) {
    R[i] = 0;
    for (int j = 0, ThxDem = cnt; j < ThxDem; ++j)
      R[i] = (R[i] << 1) | ((i >> j) & 1);
  }
  for (int i = 0, ThxDem = m; i < ThxDem; ++i) cp1[i] = 0, cp2[i] = 0;
  for (int i = 0, ThxDem = p1.size(); i < ThxDem; ++i) cp1[i] = p1[i];
  for (int i = 0, ThxDem = p2.size(); i < ThxDem; ++i) cp2[i] = p2[i];
  dft(cp1, m, false);
  dft(cp2, m, false);
  for (int i = 0, ThxDem = m; i < ThxDem; ++i) cp1[i] = cp1[i] * cp2[i];
  dft(cp1, m, true);
  vector<int> res;
  n -= 2;
  for (int i = 0, ThxDem = n; i < ThxDem; ++i)
    res.push_back((int)floor(cp1[i].real() + 0.5));
  return res;
}
const int SQ = 10000;
int pre[(MAXN + SQ - 1) / SQ][200001];
string s, t;
int query(int l, int r, int st) {
  int b1 = l / SQ, b2 = r / SQ, len = r - l + 1;
  int ans = 0;
  if (b1 == b2) {
    for (int i = l, ThxDem = r + 1; i < ThxDem; ++i)
      ans += s[i] != t[st + (i - l)];
  } else {
    for (int i = l, ThxDem = SQ * (b1 + 1); i < ThxDem; ++i)
      ans += s[i] != t[st + (i - l)];
    for (int i = SQ * b2, ThxDem = r + 1; i < ThxDem; ++i)
      ans += s[i] != t[st + (i - l)];
    for (int i = b1 + 1, ThxDem = b2; i < ThxDem; ++i) {
      int ml = i * SQ;
      int he = st + (ml - l);
      ans += pre[i][he];
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s >> t;
  int n = int(s.size()), m = int(t.size());
  memset(pre, 0, sizeof(pre));
  reverse(t.begin(), t.end());
  vector<int> he1, he2;
  for (auto x : t) he1.push_back(x == '1'), he2.push_back(x == '0');
  reverse(t.begin(), t.end());
  for (int i = 0; i + SQ <= n; i += SQ) {
    vector<int> me1(SQ), me2(SQ);
    for (int j = 0, ThxDem = SQ; j < ThxDem; ++j)
      me1[j] = s[i + j] == '1', me2[j] = s[i + j] == '0';
    vector<int> p1 = multiply(me1, he1);
    vector<int> p2 = multiply(me2, he2);
    int id = i / SQ;
    for (int j = 0, ThxDem = m; j < ThxDem; ++j)
      if (j + SQ <= m) pre[id][j] = SQ - (p1[m - j - 1] + p2[m - j - 1]);
  }
  int q;
  cin >> q;
  while (q--) {
    int a, b, len;
    cin >> a >> b >> len;
    cout << query(a, a + len - 1, b) << "\n";
  }
}
