Comparison of substrings

Input

The first line contains the string $S$ ( $1 \leq ∣ S ∣ \leq 1 0^{5}$ 1 \leq |S| \leq 10^5). The second line contains an integer $m$ , the number of queries ( $1 \leq m \leq 1 0^{5}$ 1 \leq m \leq 10^5). Each of the following $m$ lines contains four integers: $a$ , $b$ , $c$ , and $d$ , representing the indices of the substrings.

Output

For each query, print "Yes" if the substrings $[S_{a} \dots S_{b}]$ [S_a \ldots S_b] and $[S_{c} \dots S_{d}]$ [S_c \ldots S_d] are identical, otherwise print "No".

Examples

Example 1

Loading