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

using ll = long long;

const int N = 1e5+5;

int n, m, a[N];
int mx[4*N];
ll st[4*N];

void pull(int id) {
    mx[id] = max(mx[id << 1], mx[id << 1 | 1]);
    st[id] = st[id << 1] + st[id << 1 | 1];
}

void build(int id, int l, int r) {
    if (l == r) {
        st[id] = mx[id] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    pull(id);
}

void update(int id, int l, int r, int k, int x) {
    if (l == r) {
        st[id] = mx[id] = x;
        return;
    }
    int mid = (l + r) >> 1;
    if (k <= mid) update(id << 1, l, mid, k, x);
    else update(id << 1 | 1, mid + 1, r, k, x);
    pull(id);
}

void update_mod(int id, int l, int r, int u, int v, int x) {
    if (v < l || r < u || mx[id] < x) return;
    if (l == r) {
        st[id] %= x;
        mx[id] %= x;
        return;
    }
    int mid = (l + r) >> 1;
    update_mod(id << 1, l, mid, u, v, x);
    update_mod(id << 1 | 1, mid + 1, r, u, v, x);
    pull(id);
}

ll query(int id, int l, int r, int u, int v) {
    if (v < l || r < u) return 0;
    if (u <= l && r <= v) return st[id];
    int mid = (l + r) >> 1;
    return query(id << 1, l, mid, u, v) + query(id << 1 | 1, mid + 1, r, u, v);
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);
    while (m--) {
        int op; cin >> op;
        if (op == 1) {
            int l, r; cin >> l >> r;
            cout << query(1, 1, n, l, r) << '\n';
        } else if (op == 2) {
            int l, r, x; cin >> l >> r >> x;
            update_mod(1, 1, n, l, r, x);
        } else if (op == 3) {
            int k, x; cin >> k >> x;
            update(1, 1, n, k, x);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    
    int tests = 1; // cin >> tests;
    while (tests--) solve();

    #ifdef LOCAL
    cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
    return 0;
}