import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

def mos_algorithm(LL, RR, max_r):
    q = len(LL)
    h = round(max_r/q**0.5)
    gn = (max_r-1)//h+1
    qis = [[] for _ in range(gn)]
    for qi in range(q): qis[LL[qi]//h].append(qi)

    ans = [-1]*q
    l = r = 0
    for g in range(gn):
        qis[g].sort(key=lambda qi:RR[qi],reverse=g&1)
        for qi in qis[g]:
            L,R=LL[qi],RR[qi]
            while L < l:
                l-=1
                update(mxi[l],1)
            while r<R:
                update(mxi[r],1)
                r+=1
            while l<L:
                update(mxi[l],-1)
                l+=1
            while R<r:
                r-=1
                update(mxi[r],-1)
            ans[qi] = prod(l+1,r)
    return ans

n,q=LI()
aa=LI()

mxi=[0]*n
st=[(-1,inf)]
for i,a in enumerate(aa):
    while st[-1][-1]<=a:st.pop()
    mxi[i]=st[-1][0]+1
    st.append((i,a))

LL=[]
RR=[]
for _ in range(q):
    l,r=LI()
    LL.append(l-1)
    RR.append(r)

block_size=round(n**0.5)
blocks=[0]*((n+block_size-1)//block_size)
cnt=[0]*n

def update(i,x):
    cnt[i]+=x
    blocks[i//block_size]+=x

def prod(l,r):
    if l>=r:return 0
    bl=(l-1)//block_size+1
    br=r//block_size
    res=0
    if br<bl:
        for i in range(l,r):
            res+=cnt[i]
    else:
        for i in range(bl,br):
            res+=blocks[i]
        for i in range(l,bl*block_size):
            res+=cnt[i]
        for i in range(br*block_size,min(r,n)):
            res+=cnt[i]
    return res

ans=mos_algorithm(LL,RR,n)
print(*ans,sep="\n")