# include <stdio.h>

# include <string.h>

# include <iostream>

# include <algorithm>

// # include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

const int M = 4e5 + ;

const int mod = 1e9+;

# define RG register

# define ST static

int n, a[M];

struct SMT {

    ll mx[M], mi[M], s[M], tag[M];

    # define ls (x<<)

    # define rs (x<<|)

    inline void up(int x) {

        s[x] = s[ls] + s[rs];

        mx[x] = max(mx[ls], mx[rs]);

        mi[x] = min(mi[ls], mi[rs]);

    }

    inline void pushtag(int x, ll tg, int len) {

        mx[x] += tg;

        mi[x] += tg;

        s[x] += tg*len;

        tag[x] += tg;

    }

    inline void down(int x, int l, int r) {

        if(tag[x] == ) return ;

        int mid = l+r>>;

        pushtag(ls, tag[x], mid-l+);

        pushtag(rs, tag[x], r-mid);

        tag[x] = ;

    }

    inline void build(int x, int l, int r) {

        tag[x] = ;

        if(l == r) {

            mx[x] = mi[x] = s[x] = a[l];

            return ;

        }

        int mid = l+r>>;

        build(ls, l, mid);

        build(rs, mid+, r);

        up(x);

    }

    inline void edt(int x, int l, int r, int L, int R, int c) {

        if(L <= l && r <= R) {

            pushtag(x, c, r-l+);

            return ;

        }

        down(x, l, r);

        int mid = l+r>>;

        if(L <= mid) edt(ls, l, mid, L, R, c);

        if(R > mid) edt(rs, mid+, r, L, R, c);

        up(x);

    }

    inline void div(int x, int l, int r, int L, int R, int d) {

        if(L <= l && r <= R) {

            ll A, B;

            if(mi[x] < ) A = (mi[x] - d + ) / d;

            else A = mi[x] / d;

            if(mx[x] < ) B = (mx[x] - d + ) / d;

            else B = mx[x] / d;

            if(mi[x] - A == mx[x] - B) {

                pushtag(x, A - mi[x], r-l+);

                return ;

            }

        }

        down(x, l, r);

        int mid = l+r>>;

        if(L <= mid) div(ls, l, mid, L, R, d);

        if(R > mid) div(rs, mid+, r, L, R, d);

        up(x);

    }

    inline ll sum(int x, int l, int r, int L, int R) {

        if(L <= l && r <= R) return s[x];

        down(x, l, r);

        int mid = l+r>>;

        ll ret = ;

        if(L <= mid) ret += sum(ls, l, mid, L, R);

        if(R > mid) ret += sum(rs, mid+, r, L, R);

        return ret;

    }

    inline ll gmin(int x, int l, int r, int L, int R) {

        if(L <= l && r <= R) return mi[x];

        down(x, l, r);

        int mid = l+r>>;

        ll ret = 1e18;

        if(L <= mid) ret = min(ret, gmin(ls, l, mid, L, R));

        if(R > mid) ret = min(ret, gmin(rs, mid+, r, L, R));

        return ret;

    }

}T;

int main() {

    int Q, opt, l, r, x;

    cin >> n >> Q;

    for (int i=; i<=n; ++i) scanf("%d", a+i);

    T.build(, , n);

    while(Q--) {

         scanf("%d%d%d", &opt, &l, &r); ++l, ++r;

        if(opt == ) {

            scanf("%d", &x);

            T.edt(, , n, l, r, x);

        } else if(opt == ) {

            scanf("%d", &x);

            T.div(, , n, l, r, x);

        } else if(opt == ) printf("%lld\n", T.gmin(, , n, l, r));

        else printf("%lld\n", T.sum(, , n, l, r));

    }

    return ;

}