You've got an array, consisting of n integers a1, a2, ..., an. Also, you've got m queries, the i-th query is described by two integers li, ri. Numbers li, ri define a subsegment of the original array, that is, the sequence of numbers ali, ali + 1, ali + 2, ..., ari. For each query you should check whether the corresponding segment is a ladder. 

A ladder is a sequence of integers b1, b2, ..., bk, such that it first doesn't decrease, then doesn't increase. In other words, there is such integer x (1 ≤ x ≤ k), that the following inequation fulfills: b1 ≤ b2 ≤ ... ≤ bx ≥ bx + 1 ≥ bx + 2... ≥ bk. Note that the non-decreasing and the non-increasing sequences are also considered ladders.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105) — the number of array elements and the number of queries. The second line contains the sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 109), where number ai stands for the i-th array element.

The following m lines contain the description of the queries. The i-th line contains the description of the i-th query, consisting of two integers li, ri (1 ≤ li ≤ ri ≤ n) — the boundaries of the subsegment of the initial array.

The numbers in the lines are separated by single spaces.

Output

Print m lines, in the i-th line print word "Yes" (without the quotes), if the subsegment that corresponds to the i-th query is the ladder, or word "No" (without the quotes) otherwise. 

Examples

Input

8 6
1 2 1 3 3 5 2 1
1 3
2 3
2 4
8 8
1 4
5 8


Output

Yes
Yes
No
Yes
No
Yes
/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
    public static void main (String[] args) throws java.lang.Exception
    {
        // your code goes here
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int q = scan.nextInt();
        
        if(n == 1)  {
            for(int i = 0; i < q; i++)
                System.out.println("Yes");
            return;
        }
        int[] arr = new int[n];
        int[] modifiedIndex = new int[n];
        arr[0] = scan.nextInt();
        int mxn = 0;
        for(int i = 1; i < n; i++) {
            arr[i] = scan.nextInt();
            if(arr[i] != arr[i-1]) mxn++;
            modifiedIndex[i] = mxn;
        }
        mxn++;
        
        if(mxn == 1)  {
            for(int i = 0; i < q; i++)
                System.out.println("Yes");
            return;
        }
        
        int[] heights = new int[mxn];
        for(int i = 0; i < n; i++) {
            heights[modifiedIndex[i]] = arr[i];
        }
    //  for(int i = 0; i < mxn; i++)
    //      System.out.println(heights[i]);
        
        int[] localMaxima = new int[mxn];
        int[] localMinima = new int[mxn];
        
        if(heights[0] > heights[1]) localMaxima[0] = 1;
        if(heights[0] < heights[1]) localMinima[0] = 1;
        
        if(heights[mxn - 1] > heights[mxn - 2]) localMaxima[mxn - 1] = 1;
        if(heights[mxn - 1] < heights[mxn - 2]) localMinima[mxn - 1] = 1;
        
        for(int i = 1; i < mxn - 1; i++) {
            if(heights[i] > heights[i - 1] && heights[i] > heights[i + 1])
                localMaxima[i] = 1;
            if(heights[i] < heights[i - 1] && heights[i] < heights[i + 1])
                localMinima[i] = 1;
        }
        
        for(int i = 1; i < mxn; i++) {
            localMaxima[i] += localMaxima[i - 1];
            localMinima[i] += localMinima[i - 1];
            //System.out.println(localMaxima[i] + " " + localMinima[i]);
        }
        //for(int i = 0; i < n; i++) System.out.print((i == 0? "" : " ") + modifiedIndex[i]);
        StringBuffer sb = new StringBuffer();
        for(int i = 0; i < q; i++) {
            int a = scan.nextInt() - 1;
            int b = scan.nextInt() - 1;
            int na = modifiedIndex[a];
            int nb = modifiedIndex[b];
            
            if(na == nb) {
                sb.append("Yes\n");
            } else {
                
                int maximas = localMaxima[nb] - localMaxima[na];
                int minimas = localMinima[nb - 1] - localMinima[na];
                //System.out.println(na + " " + nb + " " + maximas + " " + minimas);
                if(maximas <= 1 && minimas == 0) {
                    sb.append("Yes\n");
                } else {
                    sb.append("No\n");
                }
            }
        }
        System.out.print(sb.toString());
        
    }
    

}