/* -*- coding: utf-8 -*-
 *
 * 2931.cc:  No.2931 Shibuya 109 - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 500000;

/* typedef */

/* global variables */

int as[MAX_N];
int ass[MAX_N + 1], ops[8];

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) ass[i + 1] = ass[i] + as[i] / 9;
  
  int k = 0;
  for (int i = 0; i < n; i++)
    if (as[i] == 1) ops[k++] = i;
  
  while (qn--) {
    int l, r;
    scanf("%d%d", &l, &r), l--;

    int sum = (ass[r] - ass[l]);
    for (int i = 0; i < k; i++)
      if (l <= ops[i] && ops[i] < r) sum += r - (ops[i] + 1);

    printf("%d\n", sum);
  }
  
  return 0;
}