#include "bits/stdc++.h"
using namespace std;

#define nl "\n"
#define ll long long
#define mod  1'000'000'007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define sz(v) (int) v.size()

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v) in >> x;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v) out << x << " ";
    return out;
}

void Sira() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

void solve(){
    int n , q;
    cin >> n >> q;

    string s;
    cin >> s;

    vector < ll > pref(n + 1)  , suff(n + 1);

    auto fast_pow = [&](ll a , ll b) {
        ll res = 1;
        while(b) {
            if(b & 1) {
                res = res * a % mod;
            }
            a = a * a % mod;
            b >>= 1;
        }
        return res;
    };

    for(int i = 1 ; i <= n ; i++) {
        pref[i] = pref[i - 1] * 10 + (s[i - 1] - '0');
        pref[i] %= mod;
    }

    for(int i = n ; i >= 1 ; i--) {
        suff[i] = suff[i + 1] + (s[i - 1] - '0') * fast_pow(10 , n - i);
        suff[i] %= mod;
    }


    while(q--) {
        int l , r;
        cin >> l >> r;
        // curr1 = 1 -> l - 1
        // curr2 = l -> r
        // curr3 = r + 1 -> n

        ll curr1 = pref[l - 1];
        ll curr2 = suff[r + 1];
//        cout << pref[l - 1] << " " << pref[r] << nl;
        ll curr3 = pref[r] - (l == 1 ? 0 : pref[l - 1]) * fast_pow(10 , r - l + 1);
        curr3 = (curr3 + mod) % mod;
        curr2 = (curr2 + mod) % mod;
        curr1 = (curr1 + mod) % mod;

        string s = to_string(curr3);
        reverse(all(s));
        curr3 = stoll(s);

        string s1;


       if(l > 1) s1 += to_string(curr1);
       s1 += to_string(curr3);
       if(r < n) s1 += to_string(curr2);
        ll ans = stoll(s1);
        ans %= mod;

        cout << ans << nl;
    }

}

int main() {
    Sira();
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}