由于这个帖子说暴力能过这题，我就打了个暴力代码，但 TLE#12，好像是取模的问题，但我不会改，求调qwq。

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll N = 1e5 + 9;

inline ll read() {ll n = 0; int f = 1;char c = getchar(); while (c < '0' || c > '9') { if(c == '-')f = -1;c = getchar();} while (c >= '0' && c <= '9') {n = (n << 3) + (n << 1) + (c ^ 48);c = getchar();}return n * f;}	
inline void write(ll x){if(x<0){putchar('-');x=-x;}if(x>9)write(x/10);putchar(x%10^48);return;}

ll n, m, a[N], l, r, x, ans, k;
int opt;

int main() {
    
	n = read();
	m = read();
	for (ll i = 1; i <= n; ++i) {
		a[i] = read();
	}
	while (m--) {
		ans = 0;
		opt = read();
		if (opt == 1) {
			l = read();
			r = read();
			for (ll i = l; i <= r; ++i) {
				ans += a[i];
			}
			write(ans);
			puts("");
		}
		else
		if (opt == 2) {
			l = read();
			r = read();
			x = read();
			for (ll i = l; i <= r; ++i) {
				a[i] %= x;
			}
		}
		else {
			k = read();
			x = read();
			a[k] = x;
		}
	}
	
    return 0;
}