#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;

template<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}
template<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}
template<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<" "<<A.S; return o;}
template<typename T>ostream & operator << (ostream &o,const vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?" ":"");} return o;}
template<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}


#ifndef SEGMENT_TREE
#define SEGMENT_TREE

template<typename Data,typename Mono>
class SegTree{
private:
  typedef function<void(Data&,Data&)> MergeData;
  typedef function<void(Mono&,Mono&)> MergeMono;
  typedef function<void(Data&,Mono&)> Culc;
  typedef function<bool(Data&,Mono&,int&,int&)> UpdateQuery; //data,mono,left,right true::Data,Monoに作用する false::子に降りる


  int size,high;
  vector<int> left,right;
  vector<Data> dv;
  vector<Mono> mv;
  
  Data de;
  Mono me;
  MergeData df;
  MergeMono mf;
  Culc cf;
  

  inline bool nx(int &idx){
    while(idx&1){idx>>=1; if(idx){reculc(idx);}}
    return idx?idx|=1:idx;
  }

  inline void reculc(int idx){
    dv[idx]=dv[idx<<1];
    df(dv[idx],dv[(idx<<1)|1]);
    cf(dv[idx],mv[idx]);
  }

  inline void down(int idx){
    cf(dv[idx<<1],mv[idx]);
    mf(mv[idx<<1],mv[idx]);
    cf(dv[(idx<<1)|1],mv[idx]);
    mf(mv[(idx<<1)|1],mv[idx]);
    mv[idx]=me;
  }

public:
  SegTree(Data de,Mono me,MergeData df,MergeMono mf,Culc cf,int n=0):de(de),me(me),df(df),mf(mf),cf(cf){init(n);}

  void init(int n){
    size=1;
    high=0;
    while(size<n){size<<=1; high++;}
    dv.assign(size<<1,de);
    mv.assign(size<<1,me);
    left.resize(size<<1);
    right.resize(size<<1);
    for(int i=0;i<size;i++){left[size|i]=i; right[size|i]=i+1;}
    for(int i=size-1;i>0;i--){left[i]=left[i<<1]; right[i]=right[(i<<1)|1];}
  }

  void build(const vector<Data> &ary){
    int n=ary.size();
    init(n);
    for(int i=0;i<n;i++){dv[size|i]=ary[i];}
    for(int i=size-1;i>0;i--){dv[i]=dv[i<<1]; df(dv[i],dv[(i<<1)|1]);}
  }

  //[lf,rg)
  Data query(int lf,int rg){
    Data ret=de;
    int idx=1;
    bool j=true;
    while(j){
      if(right[idx]<=lf || rg<=left[idx]){j&=nx(idx);}
      else if(lf<=left[idx] && right[idx]<=rg){df(ret,dv[idx]); j&=nx(idx);}
      else{down(idx); idx<<=1;}
    }
    return ret;
  }

  void update(int lf,int rg,Mono m){
    int idx=1;
    bool j=true;
    while(j){
      if(right[idx]<=lf || rg<=left[idx]){j&=nx(idx);}
      else if(lf<=left[idx] && right[idx]<=rg){
        cf(dv[idx],m); mf(mv[idx],m); j&=nx(idx);
      }
      else{down(idx); idx<<=1;}
    }
  }

  void update(int lf,int rg,UpdateQuery br){
    int idx=1;
    bool j=true;
    while(j){
      if(right[idx]<=lf || rg<=left[idx]){j&=nx(idx);}
      else if(lf<=left[idx] && right[idx]<=rg){
        if(br(dv[idx],mv[idx],left[idx],right[idx])){j&=nx(idx);}
        else{down(idx); idx<<=1;}
      }
      else{down(idx); idx<<=1;}
    }
  }
};

#endif /*SEGMENT_TREE*/


struct Data{
  ll mx,mi,lcm,sum,num;
};

inline ll gcd(ll a,ll b){
  while(b!=0){a%=b; swap(a,b);}
  return a;
}

const ll MX=1e18;


int main(){
  auto df=[](Data &a,Data &b){
            a.mx=max(a.mx,b.mx);
            a.mi=min(a.mi,b.mi);
            a.sum+=b.sum;
            a.lcm=a.lcm/gcd(a.lcm,b.lcm);
            a.num+=b.num;
            if(MX/a.lcm>=b.lcm && MX>=a.lcm*b.lcm){a.lcm*=b.lcm;}
            else{a.lcm=MX;}
          };
  auto mf=[](pll &a,pll &b){a=(b.F==0?a:b);};
  auto cf=[](Data &a,pll &b){
            if(b.F){a={b.S,b.S,b.S,b.S*a.num,a.num};}
          };
  Data de={1,1,1,0,0};
  pll me={0,0};

  ll n,q;
  cin>>n>>q;
  vector<ll> A(n);
  cin>>A;
  vector<Data> arr(n);
  for(int i=0;i<n;i++){
    arr[i]={A[i],A[i],A[i],A[i],1};
  }
  SegTree<Data,pll> Tr(de,me,df,mf,cf);
  Tr.build(arr);

  for(int i=0;i<q;i++){
    int c,l,r,x;
    cin>>c>>l>>r;
    l--; r--;
    if(c==1){
      cin>>x;
      Tr.update(l,r+1,{1,x});
    }
    else if(c==2){
      cin>>x;
      auto qr=[&](Data &d,pll &m,int &l,int &r)->bool{
                if(d.mx==d.mi){
                  ll g=gcd(d.mx,x);
                  d={g,g,g,d.num*g,d.num};
                  m={1,g};
                  return true;
                }
                else if(x%d.lcm==0){
                  return true;
                }
                else{
                  return false;
                }
              };
      Tr.update(l,r+1,qr);
    }
    else if(c==3){
      auto ret=Tr.query(l,r+1);
      cout<<ret.mx<<endl;
    }
    else{
      auto ret=Tr.query(l,r+1);
      cout<<ret.sum<<endl;
    }
  }

  
  return 0;
}