#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1500000000
#define mod 998244353
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
ll gcdd(ll a,ll b){
   return __gcd(a,b);
}
ll makeL(ll a,ll b){
    if(a == 0) return b;
    if(b == 0) return a;
    if(a >= INF || b >= INF) return INF;
    return min((ll)(INF),a*b/gcdd(a,b));
}
ll L[1<<18],mx[1<<18],sum[1<<18];
ll upd[1<<18];
void push(int k,ll val){
    L[k*2+1] = L[k*2+2] = mx[k*2+1] = mx[k*2+2] = upd[k*2+1] = upd[k*2+2] = upd[k];
    sum[k*2+1] = sum[k*2+2] = val * upd[k];
    upd[k] = 0;
}
void update(int x,ll v){
	x += (1<<17)-1;
	L[x] = sum[x] = mx[x] = v;
	while(x){
		x = (x-1)/2;
		L[x] = makeL(L[x*2+1],L[x*2+2]);
		sum[x] = sum[x*2+1]+sum[x*2+2];
		mx[x] = max(mx[x*2+1],mx[x*2+2]);
	}
}
void set_val(int a,int b,int k,int l,int r,ll x){
	if(r<a || b<l) return;
	if(a<=l && r<=b){
		L[k] = x;
		sum[k] = x * (r-l+1);
		mx[k] = x;
		upd[k] = x;
		return;
	}
	if(upd[k]) push(k,(r-l+1)/2);
	set_val(a,b,k*2+1,l,(l+r)/2,x);
	set_val(a,b,k*2+2,(l+r)/2+1,r,x);
	L[k] = makeL(L[k*2+1],L[k*2+2]);
	sum[k] = sum[k*2+1]+sum[k*2+2];
	mx[k] = max(mx[k*2+1],mx[k*2+2]);
}
void gcd_val(int a,int b,int k,int l,int r,ll x){
	if(r<a || b<l || (L[k]<=x && x%L[k]==0)) return;
	if(a<=l && r<=b && L[k]*(r-l+1) == sum[k]){
		L[k] = gcdd(x,L[k]);
		sum[k] = L[k] * (r-l+1);
		upd[k] = L[k];
		mx[k] = L[k];
		return;
	}
	if(upd[k]) push(k,(r-l+1)/2);
	gcd_val(a,b,k*2+1,l,(l+r)/2,x);
	gcd_val(a,b,k*2+2,(l+r)/2+1,r,x);
	//assume time complexity is log^2
	if(a<=l && r<=b){
		L[k] = makeL(L[k*2+1],L[k*2+2]);
	}
	else{
		L[k] = makeL(L[k*2+1],L[k*2+2]);
	}
	sum[k] = sum[k*2+1]+sum[k*2+2];
	mx[k] = max(mx[k*2+1],mx[k*2+2]);
}
ll calc_max(int a,int b,int k,int l,int r){
	if(r<a || b<l) return 0;
	if(a<=l && r<=b){
		return mx[k];
	}
	if(upd[k]) push(k,(r-l+1)/2);
	return max(calc_max(a,b,k*2+1,l,(l+r)/2),calc_max(a,b,k*2+2,(l+r)/2+1,r));
}
ll calc_sum(int a,int b,int k,int l,int r){
	if(r<a || b<l) return 0;
	if(a<=l && r<=b){
		return sum[k];
	}
	if(upd[k]) push(k,(r-l+1)/2);
	return (calc_sum(a,b,k*2+1,l,(l+r)/2)+calc_sum(a,b,k*2+2,(l+r)/2+1,r));
}
int main(){
	int n,q;
	scanf("%d%d",&n,&q);
	repn(i,n){
		ll a; scanf("%lld",&a);
		update(i,a);
	}
	
	rep(i,q){
		int ty,L,R; ll x; scanf("%d%d%d",&ty,&L,&R);
		if(ty <= 2) scanf("%lld",&x);
		if(ty == 1){
			set_val(L,R,0,0,(1<<17)-1,x);
		}
		else if(ty == 2){
			gcd_val(L,R,0,0,(1<<17)-1,x);
		}
		else if(ty == 3){
			printf("%lld\n",calc_max(L,R,0,0,(1<<17)-1));
		}
		else{
			printf("%lld\n",calc_sum(L,R,0,0,(1<<17)-1));
		}
	}
	return 0;
}