#include <bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

#ifdef LOCAL
bool local = true;
#else
bool local = false;
#endif

mt19937 rnd(234);
const ll inf = 1e18;
const ll mod = 1e9 + 7;

struct SGT{
    struct node{
        int dp[3][2][2];


        void build(int x){
            for(int i = 0; i < 3; i += 1){
                for(int j = 0; j < 2; j += 1){
                    for(int k = 0; k < 2; k += 1){
                        dp[i][j][k] = 0;
                    }
                }
            }
            for(int c = 0; c < 10; c += 1){
                int bg = 1;
                int nd = 1;
                if(c == 1){
                    nd = 0;
                } else if(c == 3){
                    bg = 0;
                }
                if(c < x){
                    dp[0][bg][nd] += 1;
                } else if(c == x){
                    dp[1][bg][nd] += 1;
                } else {
                    dp[2][bg][nd] += 1;
                }
            }
        }
    };


    void merge(const node &a, const node &b, node &c){
        for(int i = 0; i < 3; i += 1) {
            for(int j = 0; j < 2; j += 1) {
                for(int k = 0; k < 2; k += 1) {
                    c.dp[i][j][k] = 0;
                }
            }
        }
        for(int sa = 0; sa < 3; sa += 1){
            for(int bga = 0; bga < 2; bga += 1){
                for(int nda = 0; nda < 2; nda += 1){
                    for(int sb = 0; sb < 3; sb += 1){
                        for(int bgb = 0; bgb < 2; bgb += 1){
                            for(int ndb = 0; ndb < 2; ndb += 1){
                                if(nda == 0 && bgb == 0){
                                    continue;
                                }
                                int sc = sa;
                                if(sc == 1){
                                    sc = sb;
                                }
                                c.dp[sc][bga][ndb] = (c.dp[sc][bga][ndb] + (ll)(a.dp[sa][bga][nda]) * b.dp[sb][bgb][ndb]) % mod;
                            }
                        }
                    }
                }
            }
        }
    }


    int n;
    vector<node> t;


    void upd(int v){
        merge(t[v + v], t[v + v + 1], t[v]);
    }


    void build(int v, int tl, int tr, vector<int> &a){
        if(tl == tr){
            t[v].build(a[tl]);
            return;
        }
        int tm = (tl + tr) / 2;
        build(v + v, tl, tm, a);
        build(v + v + 1, tm + 1, tr, a);
        upd(v);
    }


    void build(vector<int> &a){
        n = (int)a.size();
        t.resize(n * 4);
        build(1, 0, n - 1, a);
    }


    void chng(int v, int tl, int tr, int i, int x){
        if(tl == tr){
            t[v].build(x);
            return;
        }
        int tm = (tl + tr) / 2;
        if(i <= tm){
            chng(v + v, tl, tm, i, x);
        } else{
            chng(v + v + 1, tm + 1, tr, i, x);
        }
        upd(v);
    }


    void chng(int i, int x){
        chng(1, 0, n - 1, i, x);
    }


    node get(int v, int tl, int tr, int l, int r){
        if(l <= tl && tr <= r){
            return t[v];
        }
        int tm = (tl + tr) / 2;
        if(r <= tm){
            return get(v + v, tl, tm, l, r);
        }
        if(tm + 1 <= l){
            return get(v + v + 1, tm + 1, tr, l, r);
        }
        auto rsl = get(v + v, tl, tm, l, r);
        auto rsr = get(v + v + 1, tm + 1, tr, l, r);
        node rs;
        merge(rsl, rsr, rs);
        return rs;
    }


    ll get(int l, int r){
        ll rs = 0;
        auto x = get(1, 0, n - 1, l, r);
        for(int s = 0; s < 2; s += 1){
            for(int bg = 0; bg < 2; bg += 1){
                for(int nd = 0; nd < 2; nd += 1){
                    rs = (rs + x.dp[s][bg][nd]) % mod;
                }
            }
        }
        return rs;
    }
};


template<class T>
ostream& operator<<(ostream& out, vector<T> &a){
    for(auto x: a){
        out << x << " ";
    }
    return out;
}


SGT sgt;
int n, q;
vector<int> a;


int32_t main(){
    if(true){
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> q;
    a.resize(n);
    for(int i = 0; i < n; i += 1){
        char c;
        cin >> c;
        a[i] = c - '0';
    }
    sgt.build(a);
    cout << sgt.get(0, n - 1) << "\n";
    for(int itr = 0; itr < q; itr += 1){
        int t;
        cin >> t;
        if(t == 1){
            int l, r;
            cin >> l >> r;
            --l;
            --r;
            cout << sgt.get(l, r) << "\n";
        } else if(t == 2){
            int i, x;
            cin >> i >> x;
            --i;
            sgt.chng(i, x);
        }
    }
    return 0;
}