#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

ll isqrt(ll n){
    assert(n>=0);
    ll s=sqrtl(n);
    while ((s+1)*(s+1)<=n)s++;
    while (s*s>n)s--;
    return s;
}

struct S{
    ll L;
    array<ll,5> A;
    S(){}
    S(ll _x){
        L=1;
        set(_x);
    }
    void set(ll x){
        A[0]=x*L;
        rep(i,4){
            x=isqrt(x);
            A[i+1]=x*L;
        }
        return;
    };
    void shift(ll n){
        array<ll,5> B;
        for (ll i=0;i<5;i++){
            if (i+n<5){
                B[i]=A[i+n];
            }
            else{
                B[i]=1;
            }
        }
        swap(A,B);
        return;
    };
};

struct F{
    int type=0;
    ll x=0;
    ll s=0;
};

S op(S x,S y){
    S z;
    z.L=x.L+y.L;
    rep(i,5){
        z.A[i]=x.A[i]+y.A[i];
    }
    return z;
}

S e(){
    S x(0);
    x.L=0;
    return x;
}

S mapping(F f,S x){
    if (f.type==1){
        x.set(f.x);
    }
    x.shift(f.s);
    return x;
}

F composition(F f,F g){
    if (f.type==1){
        return f;
    }
    g.s+=f.s;
    return g;
}

F id(){
    F f;
    f.type=0;
    f.x=0;
    f.s=0;
    return f;
}

void solve() {
    ll N,Q;
    cin>>N>>Q;
    vector<ll> A(N);
    rep(i,N)cin>>A[i];
    vector<S> V(N);
    rep(i,N){
        V[i]=S(A[i]);
    }
    lazy_segtree<S,op,e,F,mapping,composition,id> lst(V);
    rep(_,Q){
        ll t;
        cin>>t;
        if (t==0){
            ll l,r;
            cin>>l>>r;
            S res=lst.prod(l,r);
            ll ans=res.A[0];
            cout<<ans<<'\n';
        }
        else if (t==1){
            ll l,r,x;
            cin>>l>>r>>x;
            F f;
            f.type=1;
            f.x=x;
            f.s=0;
            lst.apply(l,r,f);
        }
        else if (t==2){
            ll l,r;
            cin>>l>>r;
            F f;
            f.type=0;
            f.x=0;
            f.s=1;
            lst.apply(l,r,f);
        }
    }
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}