#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


void solve(){
    int n, q; cin >> n >> q;
    vector<int> a(n+1, 0);
    for(int i=1; i<=n; i++) cin >> a[i];
    vector<int> sum(n+2, 0), pos1;
    for(int i=n; i>=1; i--){
        sum[i] = sum[i+1];
        if(a[i] == 9) sum[i]++;
        if(a[i] == 1) pos1.push_back(i);
    }

    while(q--){
        int l, r; cin >> l >> r;
        int ans = sum[l] - sum[r+1];
        for(int i : pos1) if(l <= i && i <= r) ans += (r - i);
        cout << ans << '\n';
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}