#include <bits/stdc++.h>
#define int long long
#define INF 0x3fffffff
#define INFF 1e18
#define endl '\n'
#define lson id << 1
#define rson id << 1 | 1

using namespace std;

const int N = 1e5 + 5;

int a[N], T[N << 2], mx[N << 2];

void pushup(int id) {
	T[id] = T[lson] + T[rson];
	mx[id] = max(mx[lson], mx[rson]);
}

void build(int id, int l, int r) {
	if (l == r) {
		T[id] = mx[id] = a[l];
		return;
	}
	int mid = (l + r) >> 1;
	build(lson, l, mid), build(rson, mid + 1, r);
	pushup(id);
}

void update_mod(int id, int l, int r, int x, int y, int v) {
	if (x <= l && r <= y && T[id] < v) return;
	if (x <= l && r <= y && l == r) {
		T[id] %= v, mx[id] %= v;
		return;
	} 
	int mid = (l + r) >> 1;
	if (x <= mid) update_mod(lson, l, mid, x, y, v);
	if (y > mid) update_mod(rson, mid + 1, r, x, y, v);
	pushup(id);
}

void update(int id, int l, int r, int x, int v) {
	if (l == r && l == x) {
		T[id] = mx[id] = v;
		return;
	}
	int mid = (l + r) >> 1;
	if (x <= mid) update(lson, l, mid, x, v);
	else update(rson, mid + 1, r, x, v);
	pushup(id);
}

int query(int id, int l, int r, int x, int y) {
	if (x <= l && r <= y) return T[id];
	int mid = (l + r) >> 1, ans = 0;
	if (x <= mid) ans += query(lson, l, mid, x, y);
	if (y > mid) ans += query(rson, mid + 1, r, x, y);
	return ans;
}

signed main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	build(1, 1, n);
	for (int i = 1; i <= m; i ++) {
		int op, x, y, z;
		cin >> op >> x >> y;
		if (op == 1) {
			cout << query(1, 1, n, x, y) << endl;
		} else if (op == 2) {
			cin >> z;
			update_mod(1, 1, n, x, y, z);
		} else {
			update(1, 1, n, x, y);
		}
	}
	return 0;
}

求条