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'.
# python3
import sys


def read_all_following_lines():
    lines = sys.stdin.readlines()
    return (tuple(map(int, line.split())) for line in lines)


class AbcString(object):
    def __init__(self, string):
        self.prefix_bc = [0]
        self.a_strike = [0]

        bc, strike = 0, 0
        for symbol in string:
            if symbol == 'A':
                strike += 1
            else:
                strike = 0
                bc += 1
            self.prefix_bc.append(bc)
            self.a_strike.append(strike)

    def get_info(self, begin, end):
        bc = self.prefix_bc[end] - self.prefix_bc[begin]
        trailing_a = min(self.a_strike[end], end - begin)
        return bc, trailing_a


def can_mutate(start, finish):
    from_bc, from_a = start
    to_bc, to_a = finish

    if (from_bc & 1) != (to_bc & 1): return False
    if from_bc > to_bc: return False
    if from_a < to_a: return False

    if from_bc == to_bc: return (from_a - to_a) % 3 == 0
    if from_a == to_a: return from_bc != 0

    # from_bc < to_bc
    # from_a > to_a
    return True


def main():
    s = AbcString(input())
    t = AbcString(input())
    input()  # skip one line
    requests = read_all_following_lines()

    answer = ""
    for (a, b, c, d) in requests:
        can = can_mutate(s.get_info(a - 1, b), t.get_info(c - 1, d))
        answer += "1" if can else "0"

    print(answer)


main()
