import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
n,q = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
a = list(map(int,input().split()))
o = []
for i in range(n):
    if a[i] == 0:
        o.append(i)
b = [1 if a[i] == 9 else 0 for i in range(n)]
b = list(itertools.accumulate(b)) + [0]
for i in range(q):
    l,r = map(lambda x:int(x)-1,input().split())
    ans = b[r] - b[l-1]
    for j in o:
        if l <= j <= r:
            ans += r - j + 1
    print(ans)