def bin(arr, n):
    a,b = 0, len(arr)-1
    while a<= b:
        k=(a+b)//2
        if arr[k] == n:
            return k
        if a==b:
            if arr[k] > n: return k-1
            return k
        if arr[k] > n: b=k-1
        else: a=k+1
    return b

vstup = input()
n,q = [int(i) for i in vstup.split(" ")]

hrany = [0]

vstup = input()
arr = [int(i) for i in vstup.split(" ")]
last = arr[0]
for i, a in enumerate(arr):
    if a < last:
        hrany.append(i)
    last = a

hrany.append(len(arr))

for _ in range(q):
    vstup = input()
    l,r = [int(i) for i in vstup.split(" ")]
    out = hrany[bin(hrany,r-1)]
    # print(l,r,out)
    if l-1 < out:
        print("NO")
    else:
        print("YES")