rt。

#include <bits/stdc++.h>
#define int long long
using namespace std;
const long long INF = 1e18;
struct seg {
	unsigned sum; int l;
} tree[800005];
long long a[200005], n, m;
void pushup(int x) {
	tree[x].sum = tree[x*2].sum + tree[x*2+1].sum;
	if(tree[x*2].l == -1 || tree[x*2+1].l == -1) tree[x].l = -1;
	else {
		long long G = __gcd(tree[x*2].l, tree[x*2+1].l);
		if((tree[x*2].l / G) > (INF / tree[x*2+1].l)) {
			tree[x].l = -1;
		} else tree[x].l = tree[x*2].l / G * tree[x*2+1].l;
	}
} void build(int x, int l, int r) {
	if(l == r) {
		tree[x].sum = tree[x].l = a[l]; return ;
	} int mid = (l + r) >> 1;
	build(x*2, l, mid); build(x*2+1, mid+1, r);
	pushup(x);
} void change_gcd(int x, int l, int r, int y) {
	if(l == r) {
		tree[x].sum = __gcd(1ll * tree[x].sum, y); tree[x].l = tree[x].sum; return ;
	} int mid = (l + r) >> 1;
	if(tree[x*2].l != -1 && y % tree[x*2].l) change_gcd(x*2, l, mid, y);
	if(tree[x*2+1].l != -1 && y % tree[x*2+1].l) change_gcd(x*2+1, mid+1, r, y);
	pushup(x);
} void update(int x, int l, int r, int L, int R, int y) {
	if(L <= l && r <= R) {
		if(tree[x].l != -1 && y % tree[x].l) change_gcd(x, l, r, y);
		return ;
	} int mid = (l + r) >> 1;
	if(mid >= L) update(x*2, l, mid, L, R, y);
	if(mid < R) update(x*2+1, mid+1, r, L, R, y);
	pushup(x);
} unsigned query(int x, int l, int r, int L, int R) {
	if(l > R || r < L) return 0;
	if(L <= l && r <= R) {
		return tree[x].sum;
	} int mid = (l + r) >> 1;
	return query(x*2, l, mid, L, R) + query(x*2+1, mid+1, r, L, R);
} signed main() {
	cin >> n >> m;
	for(int i = 1;i <= n;i++) cin >> a[i]; build(1, 1, n);
	while(m--) {
		long long opt, l, r, x; cin >> opt >> l >> r;
		if(opt == 1) cin >> x, update(1, 1, n, l, r, x);
		else cout << query(1, 1, n, l, r) << endl;
	}
	return 0;
}