#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n;
long long a[maxn];
class SegmentTree {
 private:
  long long wife[maxn << 2], sum[maxn << 2];
  inline void pushup(int u) {
    wife[u] = max(wife[u << 1], wife[u << 1 | 1]);
    sum[u] = sum[u << 1] + sum[u << 1 | 1];
  }

 public:
  void build(int u, int l, int r) {
    if (l == r) return sum[u] = wife[u] = a[l], void();
    int mid = (l + r) >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
    pushup(u);
  }
  void modifymod(int u, int l, int r, int x, int y, long long val) {
    if (wife[u] < val) return;
    if (l == r) return wife[u] %= val, sum[u] %= val, void();
    int mid = (l + r) >> 1;
    if (x <= mid) modifymod(u << 1, l, mid, x, y, val);
    if (y > mid) modifymod(u << 1 | 1, mid + 1, r, x, y, val);
    pushup(u);
  }
  void modifyval(int u, int l, int r, int x, long long val) {
    if (l == r) return wife[u] = sum[u] = val, void();
    int mid = (l + r) >> 1;
    if (x <= mid)
      modifyval(u << 1, l, mid, x, val);
    else
      modifyval(u << 1 | 1, mid + 1, r, x, val);
    pushup(u);
  }
  long long query(int u, int l, int r, int x, int y) {
    if (x <= l && r <= y) return sum[u];
    int mid = (l + r) >> 1;
    long long res = 0;
    if (x <= mid) res += query(u << 1, l, mid, x, y);
    if (y > mid) res += query(u << 1 | 1, mid + 1, r, x, y);
    return res;
  }
} wife;
inline int read() {
  char c;
  while (!isdigit(c = getchar()))
    ;
  int x = c ^ 48;
  while (isdigit(c = getchar())) x = x * 10 + (c ^ 48);
  return x;
}
int main() {
  int q, opt, l, r;
  n = read();
  q = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  wife.build(1, 1, n);
  while (q--) {
    opt = read();
    l = read();
    r = read();
    if (opt == 1)
      printf("%lld\n", wife.query(1, 1, n, l, r));
    else if (opt == 2)
      wife.modifymod(1, 1, n, l, r, read());
    else
      wife.modifyval(1, 1, n, l, r);
  }
  return 0;
}
