You are given a string $S$ of length $N$ consisting of lowercase English letters.

You will also be given $Q$ queries. Each query consists of two integers $L$ and $R$ ($1 \leq L \leq R \leq N$), asking whether the substring $S[L\,..\,R]$ (inclusive, 1-based indexing) can be rearranged to form a palindrome.

For each query, output and Yes if the substring can be rearranged to form a palindrome and No otherwise.

The first line contains two integers : length of string $N$ ($1 \leq N \leq 10^5$) and number of queries $Q$ ($1 \leq Q \leq 10^5$).
The second line contains string $S$ of length $N$ consisting only of lowercase English letters.
The next $Q$ lines contain two integers $L$ and $R$ ($1 \leq L \leq R \leq N$) --- the range of the substring to check for being a palindrome.

For each query, print Yes if the substring $S[L\,..\,R]$ can be rearranged to form a palindrome, otherwise print No. Each answer should be on a separate line.