#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)(3033353539)
#define mod1 (int)(47)
#define mod2 (int)(mod/47)
int n, q;
int a[100005];
int f[2][400005][42];
int tag[400005];
pair<int, int> operator+(pair<int, int> x, pair<int, int> y){
    return make_pair((x.first + y.first) % mod1, (x.second + y.second) % mod2);
}
void up(int now){
    for(int i = 0; i < 11; i++){
        f[0][now][i] = f[0][now * 2][i] + f[0][now * 2 + 1][i];
        f[0][now][i] %= mod1;
    }
    for(int i = 0; i < 42; i++){
        f[1][now][i] = f[1][now * 2][i] + f[1][now * 2 + 1][i];
        f[1][now][i] %= mod2;
    }
}
int nw[42];
void wy(int p, int w){
    for(int i = 0; i < 11; i++){
        nw[i] = f[0][p][(i+w)%11];
    }
    for(int i = 0; i < 11; i++){
        f[0][p][i] = nw[i];
    }
    for(int i = 0; i < 42; i++){
        nw[i] = f[1][p][(i+w)%42];
    }
    for(int i = 0; i < 42; i++){
        f[1][p][i] = nw[i];
    }
}   
void down(int now){
    if(tag[now]){
        tag[now * 2] += tag[now];
        tag[now * 2 + 1] += tag[now];
        wy(now * 2, tag[now]);
        wy(now * 2 + 1, tag[now]);
        tag[now] = 0;
    }
}
void init_(int now, int x){
    f[0][now][0] = x % mod1;
    f[1][now][0] = x % mod2;
    for(int i = 1; i < 11; i++){
        f[0][now][i] = f[0][now][i - 1] * f[0][now][i - 1] % mod1 * f[0][now][i - 1] % mod1;
    }
    for(int i = 1; i < 42; i++){
        f[1][now][i] = f[1][now][i - 1] * f[1][now][i - 1] % mod2 * f[1][now][i - 1] % mod2;
    }
}
void init(int now, int l, int r){
    if(l == r){
        init_(now, a[l]);
        return;
    }
    int mid = l+r>>1;
    init(now * 2, l, mid);
    init(now * 2 + 1, mid + 1, r);
    up(now);
}
void change(int now, int l, int r, int x, int y){
    if(l == r){
        init_(now, y);
        return;
    }
    down(now);
    int mid = l+r>>1;
    if(x <= mid)change(now * 2, l, mid, x, y);
    else change(now * 2 + 1, mid + 1, r, x, y);
    up(now);
}
void run(int now, int l, int r, int x, int y){
    if(x <= l && r <= y){
        wy(now, 1);
        tag[now]++;
        return;
    }
    down(now);
    int mid = l+r>>1;
    if(x <= mid)run(now * 2, l, mid, x, y);
    if(y > mid)run(now * 2 + 1, mid + 1, r, x, y);
    up(now);
}
pair<int, int> query(int now, int l, int r, int x, int y){
    if(x <= l && r <= y){
        return make_pair(f[0][now][0], f[1][now][0]);
    }
    down(now);
    int mid = l+r>>1;
    pair<int, int> ans = make_pair(0, 0);
    if(x <= mid)ans = ans + query(now * 2, l, mid, x, y);
    if(y > mid)ans = ans + query(now * 2 + 1, mid + 1, r, x, y);
    return ans;
}
int solve(pair<int, int> x){
    int nw = x.second;
    while(nw % mod1 != x.first)nw += mod2;
    return nw;
}
signed main(){
    cin >> n >> q;
    for(int i = 1; i <= n; i++){
        scanf("%lld", &a[i]);
    }
    init(1, 1, n);
    while(q--){
        int op, x, y;
        scanf("%lld%lld%lld", &op, &x, &y);
        if(op == 1){
            printf("%lld\n", solve(query(1, 1, n, x, y)));
        }else if(op == 2){
            change(1, 1, n, x, y);
        }else{
            run(1, 1, n, x, y);
        }
    }
    return 0;
}