import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.math.*;

public class Milkyway {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int arraySize = sc.nextInt();
        int testCases = sc.nextInt();
        int[] galaxies = new int[arraySize];
        int[] groups = new int[arraySize];
        int groupId = 1;
        int indexLast = 0;
        galaxies[0] = sc.nextInt();
        for (int i = 1; i < galaxies.length; i++) {
            galaxies[i] = sc.nextInt();
            if (galaxies[i] < galaxies[i - 1]) {
                for (int j = indexLast; j < i; j++) {
                    groups[j] = groupId;
                }
                groupId++;
                indexLast = i;
            }
        }
        for (int j = indexLast; j < galaxies.length; j++) {
            groups[j] = groupId;
        }

        for (int i = 0; i < testCases; i++) {
            boolean found = false;
            int beggining = sc.nextInt() - 1;
            int end = sc.nextInt() - 1;
            if (groups[beggining] == groups[end]) {
                System.out.println("YES");
            } else {
                System.out.println("NO");
            }
        }
    }
}