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'.
def main():
    s, t = input(), input()
    s_info, t_info = fast_counter(s), fast_counter(t)
    
    queries = int(input())
    answer = ''
    for _ in range(queries):
        l1, r1, l2, r2 = map(int, input().split())
        l1, l2 = l1 - 1, l2 - 1

        from_mask = mask(l1, r1, s_info)
        to_mask = mask(l2, r2, t_info)

        if can_transform(from_mask, to_mask):
            answer += '1'
        else:
            answer += '0'

    print(answer)


def can_transform(from_mask, to_mask):
    if from_mask[0] > to_mask[0]:
        return False
    elif (to_mask[0] - from_mask[0]) % 2 != 0:
        return False
    elif to_mask[0] == from_mask[0]:
        if to_mask[1] > from_mask[1]:
            return False
        return (from_mask[1] - to_mask[1]) % 3 == 0
    elif from_mask[0] == 0:
        return to_mask[1] < from_mask[1]
    else:
        return to_mask[1] <= from_mask[1]


def mask(l, r, info):
    return (info[1][r] - info[1][l], min(r - l, info[0][r]))


def fast_counter(s):
    a_last, b_count = [0], [0]
    for c in s:
        if c == 'A':
            a_last.append(a_last[-1] + 1)
            b_count.append(b_count[-1])
        else:
            a_last.append(0)
            b_count.append(b_count[-1] + 1)
    return (a_last, b_count)
            
main()
