#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 10;
struct {
  long long val[maxn << 2], maxnum[maxn << 2];
  long long a[maxn], n;
  void pushup(long long rt) {
    val[rt] = val[rt << 1] + val[rt << 1 | 1];
    maxnum[rt] = max(maxnum[rt << 1], maxnum[rt << 1 | 1]);
  }
  void build(long long l, long long r, long long rt) {
    if (l == r) {
      cin >> val[rt];
      maxnum[rt] = val[rt];
      return;
    }
    long long mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  void updata(long long L, long long C, long long l, long long r,
              long long rt) {
    if (l == r && l == L) {
      val[rt] = C;
      maxnum[rt] = C;
      return;
    }
    long long mid = (l + r) >> 1;
    if (L <= mid) {
      updata(L, C, l, mid, rt << 1);
    } else {
      updata(L, C, mid + 1, r, rt << 1 | 1);
    }
    pushup(rt);
  }
  void modupdata(long long L, long long R, long long c, long long l,
                 long long r, long long rt) {
    if (L <= l && R >= r && maxnum[rt] < c) {
      return;
    }
    if (L <= l && R >= r && l == r) {
      val[rt] %= c;
      maxnum[rt] = val[rt];
      return;
    }
    long long mid = (l + r) >> 1;
    if (L <= mid) modupdata(L, R, c, l, mid, rt << 1);
    if (R > mid) modupdata(L, R, c, mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  long long query(long long L, long long R, long long l, long long r,
                  long long rt) {
    if (L <= l && R >= r) {
      return val[rt];
    }
    long long mid = (l + r) >> 1;
    long long ans = 0;
    if (L <= mid) ans += query(L, R, l, mid, rt << 1);
    if (R > mid) ans += query(L, R, mid + 1, r, rt << 1 | 1);
    return ans;
  }
} cctree;
int main() {
  long long n, m;
  cin >> n >> m;
  cctree.n = n;
  cctree.build(1, n, 1);
  for (long long j = 0; j < m; j++) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long x, y;
      cin >> x >> y;
      cout << cctree.query(x, y, 1, n, 1) << endl;
    } else if (type == 2) {
      long long x, y, mod;
      cin >> x >> y >> mod;
      cctree.modupdata(x, y, mod, 1, n, 1);
    } else {
      long long x, y;
      cin >> x >> y;
      cctree.updata(x, y, 1, n, 1);
    }
  }
}
