Let us consider the following operations on a string consisting of A and B:
 - Select a character in a string. If it is A, replace it with BB. If it is B, replace with AA.
 - Select a substring that is equal to either AAA or BBB, and delete it from the string.
For example, if the first operation is performed on ABA and the first character is selected, the string becomes BBBA.
If the second operation is performed on BBBAAAA and the fourth through sixth characters are selected, the string becomes BBBA.
These operations can be performed any number of times, in any order.
You are given two string S and T, and q queries a_i, b_i, c_i, d_i.
For each query, determine whether S_{a_i} S_{{a_i}+1} ... S_{b_i}, a substring of S, can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, a substring of T.

-----Constraints-----
 - 1 \leq |S|, |T| \leq 10^5
 - S and T consist of letters A and B.
 - 1 \leq q \leq 10^5
 - 1 \leq a_i \leq b_i \leq |S|
 - 1 \leq c_i \leq d_i \leq |T|

-----Input-----
Input is given from Standard Input in the following format:
S
T
q
a_1 b_1 c_1 d_1
...
a_q b_q c_q d_q

-----Output-----
Print q lines. The i-th line should contain the response to the i-th query. If S_{a_i} S_{{a_i}+1} ... S_{b_i} can be made into T_{c_i} T_{{c_i}+1} ... T_{d_i}, print YES. Otherwise, print NO.

-----Sample Input-----
BBBAAAABA
BBBBA
4
7 9 2 5
7 9 1 4
1 7 2 5
1 7 2 4

-----Sample Output-----
YES
NO
YES
NO

The first query asks whether the string ABA can be made into BBBA.
As explained in the problem statement, it can be done by the first operation.
The second query asks whether ABA can be made into BBBB, and the fourth query asks whether BBBAAAA can be made into BBB.
Neither is possible.
The third query asks whether the string BBBAAAA can be made into BBBA.
As explained in the problem statement, it can be done by the second operation.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from operator import add\nimport sys\ninput=sys.stdin.readline\n\n\nclass SegTree():\n    def __init__(self, N, e, operator_func=add):\n        self.e = e # 単位元\n        self.size = N\n        self.node = [self.e] * (2*N)\n        self.operator_func = operator_func # 処理(add or xor max minなど)\n\n    def set_list(self, l):\n        for i in range(self.size):\n            self.node[i+self.size-1] = l[i]\n        for i in range(self.size-1)[::-1]:\n            self.node[i] = self.operator_func(self.node[2*i+1], self.node[2*i+2])\n    \n    def update(self, k, x):\n        k += self.size-1\n        self.node[k] = x\n        while k >= 0:\n            k = (k - 1) // 2\n            self.node[k] = self.operator_func(self.node[2*k+1], self.node[2*k+2])\n\n    def get(self, l, r):\n        # [l, r) についてqueryを求める\n        x = self.e\n        l += self.size\n        r += self.size\n\n        while l<r:\n            if l&1:\n                x = self.operator_func(x, self.node[l-1])\n                l += 1\n            if r&1:\n                r -= 1\n                x = self.operator_func(x, self.node[r-1])\n            l >>= 1\n            r >>= 1\n        return x\n\n\ndef main():\n    S = input()\n    T = input()\n    treeS = SegTree(len(S), 0)\n    treeT = SegTree(len(T), 0)\n    treeS.set_list([1 if s=="A" else 0 for s in S])\n    treeT.set_list([1 if s=="A" else 0 for s in T])\n\n    q = int(input())\n    for _ in range(q):\n        a, b, c, d = list(map(int, input().split()))\n        sa = treeS.get(a-1, b)\n        sb = b-a+1-sa\n        ta = treeT.get(c-1, d)\n        tb = d-c+1-ta\n\n        if (2*(sb-sa)+tb-ta)%3 or (sb-sa+2*(tb-ta))%3:\n            print("NO")\n        else:\n            print("YES")\n\nmain()\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 17341