Snow White and the $N$ dwarfs live in the forest. While the dwarfs mine away Snow White hangs around social networks.

Each morning the dwarfs form a long line and go whistling away to the mine. Snow White runs around them and snaps pictures to upload onto her favorite social network.

When dwarfs enter the mine, Snow White goes back to their house and goes through the pictures, selecting pretty ones. Each dwarf has a colored cap, and there are $C$ different colors. A picture is pretty if more than half caps on it are of the same color. In other words, if there are $K$ dwarfs on the picture, it is pretty if strictly more than $K / 2$ dwarfs have same colored caps.

Write a program that will check for a set of $M$ pictures if they are pretty, and what color is dominating if they are.


The first line contains two integers $N$ and $C$ ($3 \leq N \leq 300\, 000$, $1 \leq C \leq 10\, 000$), the number of dwarfs and the number of colors. The second line contains $N$ integers between $1$ and $C$ (inclusive), colors of dwarves hats, ordered the way they formed the line that morning. The third line contains $M$ ($1 \leq M \leq 10\, 000$), the number of pictures. Next $M$ lines contain two integers $A$ and $B$ ($1 \leq A \leq B \leq N$). Each line describes one picture. On it there are all dwarves starting from $A$-th all the way to the $B$-th.


Output $M$ lines. For each picture output “no” if Snow White doesn’t think the picture is pretty, and “yes $X$”, where $X$ is the color dominating on the picture, if she does.

Sample Input 1 Sample Output 1
10 3
1 2 1 2 1 2 3 2 3 3
1 2
1 3
1 4
1 5
2 5
2 6
6 9
7 10
yes 1
yes 1
yes 2
yes 3