Hr0d1y has q queries on a binary string s of length n. A binary string is a string containing only characters '0' and '1'.

A query is described by a pair of integers l_i, r_i (1 ≤ l_i < r_i ≤ n). 

For each query, he has to determine whether there exists a good subsequence in s that is equal to the substring s[l_i… r_i]. 

  * A substring s[i… j] of a string s is the string formed by characters s_i s_{i+1} … s_j.
  * String a is said to be a subsequence of string b if a can be obtained from b by deleting some characters without changing the order of the remaining characters.
  * A subsequence is said to be good if it is not contiguous and has length ≥ 2. For example, if s is "1100110", then the subsequences s_1s_2s_4 ("1100110") and s_1s_5s_7 ("1100110") are good, while s_1s_2s_3 ("1100110") is not good. 



Can you help Hr0d1y answer each query?

Input

The first line of the input contains a single integer t (1≤ t ≤ 100) — the number of test cases. The description of each test case is as follows.

The first line contains two integers n (2 ≤ n ≤ 100) and q (1≤ q ≤ 100) — the length of the string and the number of queries. 

The second line contains the string s.

The i-th of the next q lines contains two integers l_i and r_i (1 ≤ l_i < r_i ≤ n).

Output

For each test case, output q lines. The i-th line of the output of each test case should contain "YES" if there exists a good subsequence equal to the substring s[l_i...r_i], and "NO" otherwise.

You may print each letter in any case (upper or lower).

Example

Input


2
6 3
001000
2 4
1 3
3 5
4 2
1111
1 4
2 3


Output


YES
NO
YES
NO
YES

Note

In the first test case, 

  * s[2… 4] =  "010". In this case s_1s_3s_5 ("001000") and s_2s_3s_6 ("001000") are good suitable subsequences, while s_2s_3s_4 ("001000") is not good. 
  * s[1… 3] =  "001". No suitable good subsequence exists. 
  * s[3… 5] =  "100". Here s_3s_5s_6 ("001000") is a suitable good subsequence. 
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.*;

public class NonStringSubsequences {
    class Pair implements Comparable<Pair> {
        public int a;
        public int b;

        public Pair() {
            this.a = 0;
            this.b = 0;
        }

        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }

        public int compareTo(Pair p) {
            if (this.a == p.a) {
                return this.b - p.b;
            }
            return this.a - p.a;
        }

        @Override
        public String toString() {
            return "a = " + this.a + " b = " + this.b;

        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        int[] readArray(int n, int size) {
            int[] a = new int[size];
            for (int i = 0; i < n; i++) {
                a[i] = this.nextInt();
            }

            return a;
        }

        long[] readLongArray(int n, int size) {
            long[] a = new long[size];
            for (int i = 0; i < n; i++) {
                a[i] = this.nextLong();
            }
            return a;
        }
    }

    static void ruffleSort(long[] a) {
        int n = a.length;//shuffle, then sort
        for (int i = 0; i < n; i++) {
            int oi = random.nextInt(n);
            long temp = a[oi];
            a[oi] = a[i];
            a[i] = temp;
        }
        Arrays.sort(a);
    }

    static final Random random = new Random();

    static void ruffleSort(int[] a) {
        int n = a.length;//shuffle, then sort
        for (int i = 0; i < n; i++) {
            int oi = random.nextInt(n), temp = a[oi];
            a[oi] = a[i];
            a[i] = temp;
        }
        Arrays.sort(a);
    }

    public static void main(String[] args) {
        FastReader fs = new FastReader();
        int t = fs.nextInt();

        for (int z = 0; z < t; z++) {
            int n = fs.nextInt();
            int q = fs.nextInt();
            char[] word = fs.next().toCharArray();
            int[] nums = new int[n];
            int[][] dp = new int[n+2][2];
            int ones = 0;
            int zeros = 0;
            for(int i = 0; i < n; i++) {
                nums[i] = (word[i] - '0');
                dp[i+1][0] = zeros;
                dp[i+1][1] = ones;
                if(nums[i] == 1) ones++;
                else zeros++;
            }
            dp[n+1][0] = zeros;
            dp[n+1][1] = ones;
            for (int i = 0; i < q; i++) {
                int l = fs.nextInt();
                int r = fs.nextInt();
                if(r - l + 1 < 2 || r - l + 1 == n) System.out.println("NO");
                else {
                    // Two Options
                    int rn = nums[r-1];
                    //System.out.println(Arrays.toString(dp[n+1]));
                    //System.out.println(Arrays.toString(dp[r]));
                    if(dp[n+1][rn] - dp[r+1][rn] > 0) System.out.println("YES");
                    else if(dp[l][nums[l-1]] > 0) {
                        //System.out.println("Here");
                        System.out.println("YES");
                    }
                    else System.out.println("NO");
                    }
                }
            }
        }
    }