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 Python (3.4.3) (judge verdict: Time Limit Exceeded)

s=input()
Q=int(input())
for q in range(Q):
	temp=input().split()
	l=int(temp[0])-1
	r=int(temp[1])-1
	s_q=s[l:r+1]
	
	s_list=[]
	for s_i in s_q:
	    s_list.append(ord(s_i)-97)
	flag=False
	while True:
		length=len(s_list)
		for i in range(length-1):
			if s_list[i]==s_list[i+1]:
				del s_list[i+1]
				s_list[i]+=1
				if s_list[i]==26:
				    del s_list[i]
				flag=True
				#print(s_list)
				break
		if flag==True:
			flag=False
			continue
		break
	if s_list==[]:
	    print("Yes")
	else:
	    print("No")