#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

template<typename dat_type, typename lazy_type>
struct segtree {
    ll n;
    vector<dat_type> dat;
    dat_type dat_d;
    vector<lazy_type> lazy;
    lazy_type lazy_d;

    dat_type merge_dat(dat_type l, dat_type r) {
        dat_type ret;
        ret.sum = l.sum + r.sum;
        ret.max = max(l.max, r.max);
        ret.min = min(l.min, r.min);
        return ret;
    }

    segtree() {}
    segtree(int n_, dat_type dd, ll ld) : dat_d(dd), lazy_d(ld) {
        n = 1; while(n < n_) n *= 2;
        dat.assign(n*2-1, dat_d);
        lazy.assign(n*2-1, lazy_d);
    }

    void eval(int k, int l, int r) {
        if(lazy[k] == lazy_d) return;
        dat[k].sum = lazy[k] * (r-l);
        dat[k].max = dat[k].min = lazy[k];
        if(k*2+1 < n*2-1) {
            lazy[2*k+1] = lazy[k];
            lazy[2*k+2] = lazy[k];
        }
        lazy[k] = lazy_d;
    }

    void update(int a, int b, ll x, int k, int l, int r) {
        eval(k, l, r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b) {
            lazy[k] = x;
            eval(k, l, r);
            return;
        }
        int m = (l+r)>>1;
        update(a, b, x, 2*k+1, l, m);
        update(a, b, x, 2*k+2, m, r);
        dat[k] = merge_dat(dat[2*k+1], dat[2*k+2]);
    }
    void update(int a, int b, ll x) { update(a, b, x, 0, 0, n); }

    void update_gcd(int a, int b, ll x, int k, int l, int r) {
        eval(k, l, r);
        if(b <= l || r <= a) return;
        if(a <= l && r <= b && dat[k].max == dat[k].min) {
            lazy[k] = __gcd(dat[k].max, x);
            eval(k, l, r);
            return;
        }
        int m = (l+r)>>1;
        update_gcd(a, b, x, 2*k+1, l, m);
        update_gcd(a, b, x, 2*k+2, m, r);
        dat[k] = merge_dat(dat[2*k+1], dat[2*k+2]);
    }
    void update_gcd(int a, int b, ll x) { update_gcd(a, b, x, 0, 0, n); }

    dat_type query(int a, int b, int k, int l, int r) {
        eval(k, l, r);
        if(b <= l || r <= a) return dat_d;
        if(a <= l && r <= b) return dat[k];

        int m=(l+r)>>1;
        dat_type vl = query(a, b, 2*k+1, l, m);
        dat_type vr = query(a, b, 2*k+2, m, r);
        return merge_dat(vl, vr);
    }
    dat_type query(int a, int b) { return query(a, b, 0, 0, n); }
};

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, q;
    cin >> n >> q;
    vector<ll> a(n);
    REP(i, n) cin >> a[i];

    struct node {
        ll sum, max, min;
        node() : sum(0), max(-LLINF), min(LLINF) {}
        node(ll v) : sum(v), max(v), min(v) {}
    };
    segtree<node, ll> seg(n, node(), -1);
    REP(i, n) seg.update(i, i+1, a[i]);

    while(q--) {
        ll type;
        cin >> type;
        if(type == 1) {
            ll l, r, x;
            cin >> l >> r >> x;
            l--, r--;
            seg.update(l, r+1, x);
        } else if(type == 2) {
            ll l, r, x;
            cin >> l >> r >> x;
            l--, r--;
            seg.update_gcd(l, r+1, x);
        } else if(type == 3) {
            ll l, r;
            cin >> l >> r;
            l--, r--;
            cout << seg.query(l, r+1).max << endl;
        } else if(type == 4) {
            ll l, r;
            cin >> l >> r;
            l--, r--;
            cout << seg.query(l, r+1).sum << endl;
        }

        // FOR(j, 444, 488) cout << seg.query(j, j+1).max << " ";
        // cout << endl;
    }

    return 0;
}