from bisect import bisect_left, bisect_right

N, Q = map(int, input().split())
A = list(map(int, input().split()))
query = [list(map(int, input().split())) for _ in range(Q)]

cum = [0]
IDX = []
for i, a in enumerate(A):
    if a == 9:
        cum.append(cum[-1]+1)
    else:
        cum.append(cum[-1])
    if a == 1:
        IDX.append(i)

def SUM(l, r):
    return cum[r]-cum[l]

for L, R in query:
    L, R = L-1, R-1
    B = [L-1]
    idx = bisect_left(IDX, L)
    while idx < len(IDX) and IDX[idx] <= R:
        B.append(IDX[idx])
        idx += 1
    B.append(R+1)
    ans = 0
    for i in range(len(B)-1):
        if i+2 < len(B):
            ans += i
        l, r = B[i], B[i+1]
        ans += i*(r-l-1)+SUM(l+1, r)
    print(ans)