#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
const long long mod=998244353;
const long long hmod=46216567629137;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);


    //入力
    int N,Q;
    cin>>N>>Q;
    string S;
    cin>>S;
    int ans[N+1];
    pair<pair<int,int>,int>lr[Q+1];
    for(int i=1;i<=Q;i++){
        cin>>lr[i].first.second>>lr[i].first.first;
        lr[i].second=i;
    }


    //前計算等
    sort(lr+1,lr+Q+1);
    int place=1;
    deque<int>dat[10];
    for(int i=0;i<=9;i++){
        rep(j,3) dat[i].push_front(-1);
    }
    vector<string>check_number;
    for(int i=104;i<1000;i+=8){
        string ss=to_string(i);
        if(ss[0]=='0'||ss[1]=='0'||ss[2]=='0') continue;
        check_number.push_back(ss);
    }
    int cnt[10];
    vector<int>minus;



    for(int i=1;i<=N;i++){
        int now_num=S[i-1]-'0';
        dat[now_num].push_front(i);
        if(dat[now_num].size()>=4) dat[now_num].pop_back();
        while(place<=Q && lr[place].first.first==i){
            int now_ans=1e9;
            int l=lr[place].first.second,r=lr[place].first.first;
            for(int j=0;j<check_number.size();j++){
                for(int k=1;k<=9;k++) cnt[k]=0;
                bool ok=1;
                minus.clear();
                int now_cnt=0;

                for(int k=2;k>=0;k--){
                    int p=check_number[j][k]-'0';
                    int plus=dat[p][cnt[p]];
                    minus.push_back(plus);
                    if(plus<l) ok=0;
                    rep(l,minus.size()){
                        if(plus>minus[l]) plus--;
                    }
                    now_cnt+=(r-(2-k))-plus;
                    cnt[p]++;
                }
                if(ok) now_ans=min(now_ans,now_cnt);
            }
            ans[lr[place].second]=now_ans;
            place++;
        }
    }
    
    for(int i=1;i<=Q;i++){
        if(ans[i]==1e9) cout<<"-1\n";
        else cout<<ans[i]<<"\n";
    }
    return 0;
}