#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 7;
int N, Q;
long long tree[maxN << 2], maxx[maxN << 2];
void pushup(int rt) {
  tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
  maxx[rt] = max(maxx[rt << 1], maxx[rt << 1 | 1]);
}
void buildTree(int rt, int l, int r) {
  if (l == r) {
    scanf("%lld", &tree[rt]);
    maxx[rt] = tree[rt];
    return;
  }
  int mid = (l + r) >> 1;
  buildTree(rt << 1, l, mid);
  buildTree(rt << 1 | 1, mid + 1, r);
  pushup(rt);
}
void update(int rt, int l, int r, int ql, int qr, long long val) {
  if (maxx[rt] < val) return;
  if (l == r) {
    tree[rt] %= val;
    maxx[rt] = tree[rt];
    return;
  }
  int mid = (l + r) >> 1;
  if (ql > mid)
    update(rt << 1 | 1, mid + 1, r, ql, qr, val);
  else if (qr <= mid)
    update(rt << 1, l, mid, ql, qr, val);
  else {
    update(rt << 1, l, mid, ql, qr, val);
    update(rt << 1 | 1, mid + 1, r, ql, qr, val);
  }
  pushup(rt);
}
void change(int rt, int l, int r, int qx, long long val) {
  if (l == r) {
    tree[rt] = maxx[rt] = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (qx <= mid)
    change(rt << 1, l, mid, qx, val);
  else
    change(rt << 1 | 1, mid + 1, r, qx, val);
  pushup(rt);
}
long long query(int rt, int l, int r, int ql, int qr) {
  if ((ql <= l && qr >= r) || tree[rt] == 0) return tree[rt];
  int mid = (l + r) >> 1;
  if (ql > mid)
    return query(rt << 1 | 1, mid + 1, r, ql, qr);
  else if (qr <= mid)
    return query(rt << 1, l, mid, ql, qr);
  else
    return query(rt << 1, l, mid, ql, qr) +
           query(rt << 1 | 1, mid + 1, r, ql, qr);
}
int main() {
  scanf("%d%d", &N, &Q);
  buildTree(1, 1, N);
  while (Q--) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int e1, e2;
      scanf("%d%d", &e1, &e2);
      printf("%lld\n", query(1, 1, N, e1, e2));
    } else if (op == 2) {
      int e1, e2;
      long long e3;
      scanf("%d%d%lld", &e1, &e2, &e3);
      update(1, 1, N, e1, e2, e3);
    } else if (op == 3) {
      int e1;
      long long e2;
      scanf("%d%lld", &e1, &e2);
      change(1, 1, N, e1, e2);
    }
  }
  return 0;
}
