#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()

#include <atcoder/segtree>
const int K = 9;
struct F {
    bool empty = true;
    array<int, K> sum;
    array<int, K> rem;
};

F op(F l, F r){
    if (l.empty) return r;
    if (r.empty) return l;
    F res;
    res.empty = false;
    rep(i, 0, K){
        res.rem[i] = r.rem[l.rem[i]];
        res.sum[i] = l.sum[i] + r.sum[l.rem[i]];
    }
    return res;
}

F e(){
    return F{};
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;
    vector<F> base(N);
    rep(i, 0, N){
        int a;
        cin >> a;
        base[i].empty = false;
        rep(j, 0, K){
            base[i].sum[j] = (10 * j + a) / K;
            base[i].rem[j] = (10 * j + a) % K;
        }
    }
    atcoder::segtree<F, op, e> seg(base);
    while (Q--){
        int l, r;
        cin >> l >> r;
        l--;
        cout << seg.prod(l, r).sum[0] << "\n";
    }
}