You are given two strings \(s\) and \(t\). You are also given the following operation to perform:

Is string \(t\) a subsequence of string \(s\) if you remove \([s_i,s_{i+1},....,s_{j-1},s_j]\) substring from string \(s\).

You are given \(q\) queries. Each query consists of indices \(i\) and \(j\). If string \(t\) is a subsequence of the remaining string \(s\), you are required to print \(Yes\). Otherwise, print \(No\).

Note: Each query is independent of each other.

Input format

First line: String \(s\)
Next line: String \(t\)
Next line: Two integers \(q\ 2\) where \(q\) denotes the number of queries and the second integer contains value \(2\)
Each of following \(q\) lines: Two integers \(i\) and \(j\) denoting the starting and ending indices of the substring that must be deleted from string \(s\)

Output format
If string \(t\) is a subsequence of the remaining string \(s\), you are required to print \(Yes\). Otherwise, print \(No\).
The answer for each query should come in a new line.

Constraints

\(1 \le |s| \le 10^5\)
\(1 \le |t| \le |s|\)
\(1 \le q \le 10^5\)
\(1 \le i \le j \le |s|\)
Both strings \(s\) and \(t\) contain lowercase English alphabets