Alice has a string consisting of characters 'A', 'B' and 'C'. Bob can use the following transitions on any substring of our string in any order any number of times: 

  * A <image> BC
  * B <image> AC
  * C <image> AB
  * AAA <image> empty string 



Note that a substring is one or more consecutive characters. For given queries, determine whether it is possible to obtain the target string from source.

Input

The first line contains a string S (1 ≤ |S| ≤ 105). The second line contains a string T (1 ≤ |T| ≤ 105), each of these strings consists only of uppercase English letters 'A', 'B' and 'C'.

The third line contains the number of queries Q (1 ≤ Q ≤ 105).

The following Q lines describe queries. The i-th of these lines contains four space separated integers ai, bi, ci, di. These represent the i-th query: is it possible to create T[ci..di] from S[ai..bi] by applying the above transitions finite amount of times?

Here, U[x..y] is a substring of U that begins at index x (indexed from 1) and ends at index y. In particular, U[1..|U|] is the whole string U.

It is guaranteed that 1 ≤ a ≤ b ≤ |S| and 1 ≤ c ≤ d ≤ |T|.

Output

Print a string of Q characters, where the i-th character is '1' if the answer to the i-th query is positive, and '0' otherwise.

Example

Input

AABCCBAAB
ABCB
5
1 3 1 2
2 2 2 4
7 9 1 1
3 4 2 3
4 5 1 3


Output

10011

Note

In the first query we can achieve the result, for instance, by using transitions <image>.

The third query asks for changing AAB to A — but in this case we are not able to get rid of the character 'B'.
#include <bits/stdc++.h>
#pragma GCC target("pclmul")
using ul = std::uint32_t;
using ull = std::uint64_t;
using li = std::int32_t;
using ll = std::int64_t;
using uss = std::uint8_t;
const ul maxn = 1e5;
char str[maxn + 2];
ul scb[maxn + 1];
ul sca[maxn + 1];
ul tcb[maxn + 1];
ul tca[maxn + 1];
ul q;
int main() {
  std::scanf("%s", str + 1);
  for (ul i = 1; str[i]; ++i) {
    if (str[i] == 'A') {
      sca[i] = sca[i - 1] + 1;
      scb[i] = scb[i - 1];
    } else {
      scb[i] = scb[i - 1] + 1;
    }
  }
  std::scanf("%s", str + 1);
  for (ul i = 1; str[i]; ++i) {
    if (str[i] == 'A') {
      tca[i] = tca[i - 1] + 1;
      tcb[i] = tcb[i - 1];
    } else {
      tcb[i] = tcb[i - 1] + 1;
    }
  }
  std::scanf("%u", &q);
  for (ul i = 1; i <= q; ++i) {
    ul a, b, c, d;
    std::scanf("%u%u%u%u", &a, &b, &c, &d);
    ul sb = scb[b] - scb[a - 1];
    ul tb = tcb[d] - tcb[c - 1];
    ul sa = std::min(sca[b], b - a + 1);
    ul ta = std::min(tca[d], d - c + 1);
    if ((sb ^ tb) & 1) {
      std::putchar('0');
      continue;
    }
    if (sa < ta) {
      std::putchar('0');
      continue;
    }
    if ((sa - ta) % 3 == 0 && sb > tb) {
      std::putchar('0');
      continue;
    }
    if ((sa - ta) % 3 != 0 && sb + 2 > tb) {
      std::putchar('0');
      continue;
    }
    if (sb == 0 && tb != 0 && sa == ta) {
      std::putchar('0');
      continue;
    }
    std::putchar('1');
  }
  std::putchar('\n');
  return 0;
}
