#include <bits/stdc++.h>
#define int long long
#define ls k << 1
#define rs k << 1 | 1
using namespace std;
template <typename T> inline T read() {
    T x = 0; bool flag = 0; char c = getchar();
    while (!isdigit(c)) flag |= c == '-', c = getchar();
    while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
    if (!flag) return x;
    return ~(x - 1);
}
template <typename T> inline void write(T x) {
    if (x < 0) putchar('-'), x = ~(x - 1);
    int stk[30], top = 0;
    while (x) stk[++top] = x % 10, x /= 10;
    if (!top) stk[++top] = 0;
    while (top) putchar(stk[top--] ^ 48);
    puts("");
    return ;
} //快读快输
const int N = 1e5 + 5;
struct Tree {
    int sum, maxx;
}T[N << 2];
int a[N];
void push_up(int k) {
    T[k].sum = T[k << 1].sum + T[k << 1 | 1].sum;
    T[k].maxx = max(T[k << 1].maxx, T[k << 1 | 1].maxx);
}
void Build(int k, int l, int r) {
    if (l == r) {
        T[k].sum = T[k].maxx = a[l];
        return ;
    }
    int mid = (l + r) >> 1;
    Build(ls, l, mid);
    Build(rs, mid + 1, r);
    push_up(k);
} //建树
void Update1(int k, int l, int r, int x, int val) {
    if (l == r) {
        T[k].sum = T[k].maxx = val;
        return ;
    }
    int mid = (l + r) >> 1;
    if (mid >= x) Update1(ls, l, mid, x, val);
    else Update1(rs, mid + 1, r, x, val);
    push_up(k);
} //单点修改
void Update2(int k, int l, int r, int L, int R, int mod) {
    if (L <= l && R >= r && T[k].maxx < mod) return ;
    if (l == r) {
        T[k].sum %= mod;
        T[k].maxx = T[k].sum;
        return ;
    }
    int mid = (l + r) >> 1;
    if (L <= mid) Update2(ls, l, mid, L, R, mod);
    if (r > mid) Update2(rs, mid + 1, r, L, R, mod);
    push_up(k);
} //区间取膜
int Query(int k, int l, int r, int L, int R) {
    if (L <= l && R >= r) return T[k].sum;
    int mid = (l + r) >> 1, ans = 0;
    if (L <= mid) ans = Query(ls, l, mid, L, R);
    if (R > mid) ans += Query(rs, mid + 1, r, L, R);
    return ans;
} //查询
signed main() {
    int n = read<int>(), q = read<int>();
    for (int i = 1; i <= n; ++i) a[i] = read<int>();
    Build(1, 1, n);
    for (int i = 1, op, l, r, p; i <= q; ++i) {
        op = read<int>(), l = read<int>(), r = read<int>();
        switch(op) {
        case 1:
            write<int>(Query(1, 1, n, l, r));
            break;
        case 2:
            p = read<int>();
            Update2(1, 1, n, l, r, p);
            break;
        case 3:
            Update1(1, 1, n, l, r);
            break;
        }
    }
    return 0;
}

Wrong answer on test 3

wrong answer 2nd numbers differ - expected: '24586940505', found: '23619220441'