#define TASK ""
#include <bits/stdc++.h>
using namespace std;
#define el cout << "\n"
#define sz(x) (ll)(x).size()
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (ll i = a; i <= (b); ++i)
using ll = long long;
using pi = pair<ll, ll>;
const ll N=2e5+1;
const ll INF=1e9+7;
ll n,q;
ll dp[N*2][2];
char a[N];
ll calc(ll idx,bool cur,bool tight,string &digit)
{
if(idx==-1)return 1;
ll mx_dg=tight?digit[idx]-'0':9;
if(!tight&&dp[idx][cur]!=-1)return dp[idx][cur];
ll res=0;
rep(i,0,mx_dg)
{
bool n_tight=tight&&i==mx_dg;
bool n_cur=0;
if(i==3&&cur)continue;
if(i==1)n_cur=1;
(res+=calc(idx-1,n_cur,n_tight,digit))%=INF;
}
if(!tight)dp[idx][cur]=res;
return res;
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
if (fopen(TASK ".inp", "r")) {
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
cin >> n>>q;
memset(dp,-1,sizeof(dp));
rep(i,1,n)cin>>a[i];
string x;
rep(i,1,n)x+=a[i];
reverse(all(x));
cout<<calc(n-1,0,1,x);el;
while(q--)
{
ll type,l,r;cin>>type>>l>>r;
if(type==1)
{
string x;
rep(i,l,r)x+=a[i];
reverse(all(x));
cout<<calc(sz(x)-1,0,1,x);el;
}
else
{
a[l]=r+'0';
}
}
return 0;
}
