#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
int op(int a, int b){
    return a+b;
}
int e(){return 0;}

void solve(){
    
}

int main(){
    int n, Q; cin >> n >> Q;
    vi v1, v;
    segtree<int, op, e> seg0(n), seg1(n), seg9(n);
    rep(i, n){
        int a; cin >> a; v.push_back(a);
        if(a == 1){
            v1.push_back(i);
            seg1.set(i, 1);
        }else if(a == 0){
            seg0.set(i, 1);
        }else{
            seg9.set(i, 1);
        }
    }
    while(Q--){
        int l, r; cin >> l >> r;
        l--; r--;
        if(seg1.prod(l, r+1) == 0){
            cout << seg9.prod(l, r+1) << endl;
            continue;
        }
        if(r == l){
            cout << v[l]/9 << endl;
            continue;
        }
        vi c1; for(auto i : v1){
            if(l <= i && i <= r)c1.push_back(i);
        }
        int ans = 0;
        int now = l;
        int c = 0;
        for(auto i : c1){
            ans += c*seg0.prod(now, i) + (c+1)*seg9.prod(now, i) + c;
            c++;
            now = i+1;
        }
        if(now <= r)ans += c*seg0.prod(now, r+1) + (c+1)*seg9.prod(now, r+1);
        cout << ans << endl;
    }

    return 0;
}