Problem:
Score : 1300 points

Problem Statement

You are developing a robot that processes strings.
When the robot is given a string t consisting of lowercase English letters, it processes the string by following the procedure below:

Let i be the smallest index such that t_i = t_{i + 1}. If such an index does not exist, terminate the procedure.

If t_i is z, remove t_i and t_{i + 1} from t. Otherwise, let c be the next letter of t_i in the English alphabet, and replace t_i and t_{i + 1} together with c, reducing the length of t by 1.

Go back to step 1.

For example, when the robot is given the string axxxxza, it will be processed as follows: axxxxza → ayxxza → ayyza → azza → aa → b.

You are given a string s consisting of lowercase English letters.
Answer Q queries. The i-th query is as follows:

Assume that the robot is given a substring of s that runs from the l_i-th character and up to the r_i-th character (inclusive). Will the string be empty after processing?

Constraints

1 ≤ |s| ≤ 5 × 10^5

s consists of lowercase English letters.

1 ≤ Q ≤ 10^5

1 ≤ l_i ≤ r_i ≤ |s|

Input

The input is given from Standard Input in the following format:

s
Q
l_1 r_1
l_2 r_2
:
l_Q r_Q

Output

Print Q lines.
The i-th line should contain the answer to the i-th query: Yes or No.

Sample Input 1

axxxxza
2
1 7
2 6

Sample Output 1

No
Yes

Regarding the first query, the string will be processed as follows: axxxxza → ayxxza → ayyza → azza → aa → b.

Regarding the second query, the string will be processed as follows: xxxxz → yxxz → yyz → zz → .

Sample Input 2

aabcdefghijklmnopqrstuvwxyz
1
1 27

Sample Output 2

Yes

Sample Input 3

yzyyyzyzyyyz
8
1 6
7 12
1 12
6 11
1 1
1 3
4 9
3 8

Sample Output 3

Yes
Yes
Yes
Yes
No
No
No
No

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.ArrayList;
import java.util.List;
import java.util.Optional;
import java.util.OptionalInt;
import java.util.Scanner;
import java.util.stream.IntStream;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		char[] s = scanner.next().toCharArray();
		int q = scanner.nextInt();
		for (int i = 0; i < q; i++) {
			int l = scanner.nextInt();
			int r = scanner.nextInt();
			List<Character> chars = new ArrayList<>();
			for (int j = 0; j < r - l + 1; j++) {
				chars.add(s[l - 1 + j]);
			}
//			chars.forEach(System.out::print);
//			System.out.println();
			while (chars.size() != 0 && changeI(chars));
			if (chars.size() == 0) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			} ;
		}
	}
	private static boolean changeI(List<Character> chars) {
		Optional<Integer> pointOp = sameI(chars);
		if (!pointOp.isPresent()) {
			return false;
		} 
		int point = pointOp.get();
		if (chars.get(point) == 'z') {
			chars.remove(point);
			chars.remove(point);
		} else {
			int a = chars.get(point) + 1;
			chars.set(point, (char) a);
			chars.remove(point + 1);
		}
		return true;
	}

	private static Optional<Integer> sameI(List<Character> a) {
		return IntStream.range(0, a.size() - 1)
			.boxed()
			.filter(e -> a.get(e) == a.get(e + 1))
			.findFirst();
	}
}