Like most of the girlfriends, Ashima when asks for something, won’t stop until she gets that.

The way she gets that is by keep on repeating the same things again and again. Like if she wants chocolate, she will just keep on repeating “chocolate” again and again.

I have decided to answer to her demands as “Yes” or “No” by not delaying a lot. Otherwise, there would be a lot of repercussions. So, randomly at certain intervals, I just answer with “Yes” or “No” using the following rule, I will just select two integers a and b, if the element at the position a is same as the element as position b in the non-ending chant by Ashima, I will speak “Yes”, otherwise say “No”.

Your job is to find my side of the conversation given the name of the demand Ashima has and the random integers I picked.

Input:

First line of the input contains a string S, the name of the item she is demanding.

Next line contains an integer Q, the number of pairs of integers that used to say “Yes” or “No” to her. These pairs are given in order.

Next Q line, each contains 2 integers, a and b. (1-based indexing)

Output:

For each query, print “Yes” or “No” as described above.

Constraints:

1 ≤ |S| ≤ 10

1 ≤ Q ≤ 10

1 ≤ a, b ≤ 10

The way she gets that is by keep on repeating the same things again and again. Like if she wants chocolate, she will just keep on repeating “chocolate” again and again.

I have decided to answer to her demands as “Yes” or “No” by not delaying a lot. Otherwise, there would be a lot of repercussions. So, randomly at certain intervals, I just answer with “Yes” or “No” using the following rule, I will just select two integers a and b, if the element at the position a is same as the element as position b in the non-ending chant by Ashima, I will speak “Yes”, otherwise say “No”.

Your job is to find my side of the conversation given the name of the demand Ashima has and the random integers I picked.

Input:

First line of the input contains a string S, the name of the item she is demanding.

Next line contains an integer Q, the number of pairs of integers that used to say “Yes” or “No” to her. These pairs are given in order.

Next Q line, each contains 2 integers, a and b. (1-based indexing)

Output:

For each query, print “Yes” or “No” as described above.

Constraints:

1 ≤ |S| ≤ 10

^{5}1 ≤ Q ≤ 10

^{5}1 ≤ a, b ≤ 10

^{18}^{}^{Sample Input:}^{}^{vgxgp}^{3}^{2 4}^{2 5}^{7 14}^{}^{Sample Output:}^{}^{Yes}^{No}^{Yes}^{}^{Implementation:}^{}#include <stdio.h> #define MAX 10000 int main() { char str[MAX]; unsigned long long int Q,a,b,len; scanf("%s",&str); scanf("%llu",&Q); len=strlen(str); while(Q--) { scanf("%llu %llu",&a,&b); /*while(a>5) a=a-5; while(b>5) b=b-5;*/ /*while(b>5) { b=b-5; }*/ if(a>5) a=a%len; if(b>5) b=b%len; if(str[a-1]==str[b-1]) printf("Yes\n"); else printf("No\n"); } return 0; }