#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int oo = 1e9 + 5;
int du[] = {-1, 0, 0, 1};
int dv[] = {0, -1, 1, 0};
const long long mod = 1e9 + 7;
long long sqr(long long x) { return x * x; }
int n, q;
struct Node {
  long long sum, Max;
  int vt;
} f[4 * N + 5];
long long lz[4 * N + 5], a[N + 5];
void build(int id, int l, int r) {
  if (l > r) return;
  if (l == r) {
    f[id].sum = a[l];
    f[id].Max = a[l];
    f[id].vt = l;
    return;
  }
  int mid = (l + r) / 2;
  build(id * 2, l, mid);
  build(id * 2 + 1, mid + 1, r);
  f[id].sum = f[id * 2].sum + f[id * 2 + 1].sum;
  if (f[id * 2].Max > f[id * 2 + 1].Max) {
    f[id].Max = f[id * 2].Max;
    f[id].vt = f[id * 2].vt;
  } else {
    f[id].Max = f[id * 2 + 1].Max;
    f[id].vt = f[id * 2 + 1].vt;
  }
}
void update1(int id, int l, int r, int u, int v, long long val) {
  if (l > r || l > v || r < u) return;
  if (l == r) {
    a[l] %= val;
    f[id].sum = a[l];
    f[id].Max = a[l];
    f[id].vt = l;
    return;
  }
  int mid = (l + r) / 2;
  if (f[id * 2].Max >= val) update1(id * 2, l, mid, u, v, val);
  if (f[id * 2 + 1].Max >= val) update1(id * 2 + 1, mid + 1, r, u, v, val);
  f[id].sum = f[id * 2].sum + f[id * 2 + 1].sum;
  if (f[id * 2].Max > f[id * 2 + 1].Max) {
    f[id].Max = f[id * 2].Max;
    f[id].vt = f[id * 2].vt;
  } else {
    f[id].Max = f[id * 2 + 1].Max;
    f[id].vt = f[id * 2 + 1].vt;
  }
}
void update2(int id, int l, int r, int u) {
  if (l > r || l > u || r < u) return;
  if (l == r) {
    f[id].sum = a[l];
    f[id].Max = a[l];
    f[id].vt = l;
    return;
  }
  int mid = (l + r) / 2;
  update2(id * 2, l, mid, u);
  update2(id * 2 + 1, mid + 1, r, u);
  f[id].sum = f[id * 2].sum + f[id * 2 + 1].sum;
  if (f[id * 2].Max > f[id * 2 + 1].Max) {
    f[id].Max = f[id * 2].Max;
    f[id].vt = f[id * 2].vt;
  } else {
    f[id].Max = f[id * 2 + 1].Max;
    f[id].vt = f[id * 2 + 1].vt;
  }
}
long long getsum(int id, int l, int r, int u, int v) {
  if (l > r || l > v || r < u) return 0;
  if (u <= l && r <= v) return f[id].sum;
  int mid = (l + r) / 2;
  return getsum(id * 2, l, mid, u, v) + getsum(id * 2 + 1, mid + 1, r, u, v);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  build(1, 1, n);
  for (int i = 1; i <= q; i++) {
    int c;
    cin >> c;
    if (c == 1) {
      int u, v;
      cin >> u >> v;
      cout << getsum(1, 1, n, u, v) << endl;
    } else if (c == 2) {
      int u, v;
      long long val;
      cin >> u >> v >> val;
      update1(1, 1, n, u, v, val);
    } else {
      int u;
      long long x;
      cin >> u >> x;
      a[u] = x;
      update2(1, 1, n, u);
    }
  }
  return 0;
}
