#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T& x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= f;
}
const int N = 1e5 + 5;
long long mx[N << 2], sum[N << 2], a[N];
int n, m;
inline void Pushup(int rt) {
  mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]);
  sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void build(int rt, int l, int r) {
  if (l == r) {
    mx[rt] = sum[rt] = a[l];
    return;
  }
  int mid = l + r >> 1;
  build(rt << 1, l, mid);
  build(rt << 1 | 1, mid + 1, r);
  Pushup(rt);
}
void up1(int rt, int l, int r, int loc, int val) {
  if (l == r) {
    mx[rt] = sum[rt] = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (loc <= mid)
    up1(rt << 1, l, mid, loc, val);
  else
    up1(rt << 1 | 1, mid + 1, r, loc, val);
  Pushup(rt);
}
void up2(int rt, int l, int r, int L, int R, int md) {
  if (md > mx[rt]) return;
  if (l == r) {
    sum[rt] %= md;
    mx[rt] = sum[rt];
    return;
  }
  int mid = (l + r) >> 1;
  if (L <= mid) up2(rt << 1, l, mid, L, R, md);
  if (R > mid) up2(rt << 1 | 1, mid + 1, r, L, R, md);
  Pushup(rt);
}
long long query(int rt, int l, int r, int L, int R) {
  if (L <= l && r <= R) return sum[rt];
  int mid = (l + r) >> 1;
  long long ans = 0;
  if (L <= mid) ans += query(rt << 1, l, mid, L, R);
  if (R > mid) ans += query(rt << 1 | 1, mid + 1, r, L, R);
  return ans;
}
int main() {
  read(n);
  read(m);
  for (int i = 1; i <= n; i++) read(a[i]);
  build(1, 1, n);
  while (m--) {
    int op;
    read(op);
    if (op == 1) {
      int l, r;
      read(l);
      read(r);
      printf("%lld\n", query(1, 1, n, l, r));
    } else if (op == 2) {
      int l, r, md;
      read(l);
      read(r);
      read(md);
      up2(1, 1, n, l, r, md);
    } else {
      int loc, c;
      read(loc);
      read(c);
      up1(1, 1, n, loc, c);
    }
  }
}
