Let us consider the following operations on a string consisting of `A` and `B`:
1. Select a character in a string. If it is `A`, replace it with `BB`. If it is `B`, replace with `AA`.
2. 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$
[samples]