#include<bits/stdc++.h>
#include<atcoder/lazysegtree>
using namespace std;

unsigned long long isqrt_aux(int c,unsigned long long n){
  if (c == 0){
    return 1;
  } else {
    int k = (c - 1) / 2;
    unsigned long long a = isqrt_aux(c / 2, n >> (2*k + 2));
    return (a << k) + (n >> (k+2)) / a;
  }
}
unsigned long isqrt(unsigned long long n){
  if (n == 0){
    return 0;
  } else {
    unsigned long long a = isqrt_aux(( 63 - __builtin_clzll(n)) / 2, n);
    return (n <= a * a - 1 ? a - 1 : a);
  }
}

using ll=long long;
int l=40;
struct S{
  int now=0;
  vector<ll> val;
  ll sz;
};
vector<ll> calc(ll x){
  vector<ll> ret(l);
  ret[0]=x;
  for (int i=1;i<l;i++) ret[i]=isqrt(ret[i-1]);
  return ret;
}
S op(S a,S b){
  S c;
  c.val=vector<ll>(l);
  for (int i=0;i<l;i++) c.val[i]=a.val[min(l-1,a.now+i)]+b.val[min(l-1,b.now+i)];
  c.now=0;
  c.sz=a.sz+b.sz;
  return c;
}
S e(){return S{0,vector<ll>(l,0),0};}
struct F{
  ll cnt;
  ll x;
};
S mapping(F f,S x){
  if (f.x!=-1){
    x.val=calc(f.x);
    for (int i=0;i<l;i++) x.val[i]*=x.sz;
    x.now=0;
  }
  x.now=min((ll)l-1,x.now+f.cnt);
  return x;
}
F composition(F f,F g){
  if (f.x!=-1) return f;
  g.cnt+=f.cnt;
  return g;
}
F id(){return F{0,-1};}

int main(){
  int n,q;
  cin>>n>>q;
  vector<ll> a(n);
  vector<S> v(n);
  for (int i=0;i<n;i++){
    cin>>a[i];
    v[i]={0,calc(a[i]),1};
  }
  atcoder::lazy_segtree<S,op,e,F,mapping,composition,id> seg(v);
  while (q--){
    int t;
    cin>>t;
    if (t==0){
      int l,r;
      cin>>l>>r;
      auto p=seg.prod(l,r);
      cout<<p.val[p.now]<<endl;
    }
    if (t==1){
      int l,r,x;
      cin>>l>>r>>x;
      seg.apply(l,r,F{0,x});
    }
    if (t==2){
      int l,r;
      cin>>l>>r;
      seg.apply(l,r,F{1,-1});
    }
  }
}