Snow White and the 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 different colors. A picture is pretty
if more than half the caps on it are of the same color. In other words, if there are
dwarfs on the picture,
it is pretty if strictly more than
dwarfs have same colored caps.
Write a program that will check for a set of pictures if they are pretty, and what color is dominating
if they are.
Input Specification
First line contains two integers and
number of dwarfs and
number of colors.
Second line contains integers between
and
(inclusive), colors of dwarves hats, ordered the way
they formed the line that morning.
Third line contains
, number of pictures.
Next lines contain two integers
and
. Each line describes one picture. On it
there are all dwarves starting from
-th all the way to the
-th.
In test cases worth 30% points, will be smaller than
.
In test cases worth additional 30% points, will be smaller than
.
Output Specification
Output lines. For each picture output
no
if Snow White doesn't think the picture is pretty, and
yes X
, where is the color dominating on the picture, if she does.
Sample Input 1
10 3
1 2 1 2 1 2 3 2 3 3
8
1 2
1 3
1 4
1 5
2 5
2 6
6 9
7 10
Sample Output 1
no
yes 1
no
yes 1
no
yes 2
no
yes 3
Comments