#include <bits/stdc++.h>
using namespace std;
struct node {
  long long sum, mx;
} tree[4 * 100005];
long long val[100005];
void build(long long pos, long long l, long long r) {
  if (l == r) {
    tree[pos].sum = val[l];
    tree[pos].mx = val[l];
    return;
  }
  long long mid = (l + r) / 2;
  build(2 * pos, l, mid);
  build(2 * pos + 1, mid + 1, r);
  tree[pos].mx = max(tree[2 * pos].mx, tree[2 * pos + 1].mx);
  tree[pos].sum = tree[2 * pos].sum + tree[2 * pos + 1].sum;
}
void updVal(long long pos, long long l, long long r, long long x) {
  if (l == r) {
    tree[pos].sum = val[l];
    tree[pos].mx = val[l];
    return;
  }
  long long mid = (l + r) / 2;
  if (x <= mid)
    updVal(2 * pos, l, mid, x);
  else
    updVal(2 * pos + 1, mid + 1, r, x);
  tree[pos].mx = max(tree[2 * pos].mx, tree[2 * pos + 1].mx);
  tree[pos].sum = tree[2 * pos].sum + tree[2 * pos + 1].sum;
}
long long query(long long pos, long long l, long long r, long long ql,
                long long qr) {
  if (ql > r || l > qr) return 0;
  if (ql <= l && r <= qr) return tree[pos].sum;
  long long mid = (l + r) / 2;
  return query(2 * pos, l, mid, ql, qr) +
         query(2 * pos + 1, mid + 1, r, ql, qr);
}
void updMod(long long pos, long long l, long long r, long long ql, long long qr,
            long long mod) {
  if (ql > r || l > qr || tree[pos].mx < mod) return;
  if (l == r) {
    tree[pos].sum %= mod;
    tree[pos].mx %= mod;
    return;
  }
  long long mid = (l + r) / 2;
  updMod(2 * pos, l, mid, ql, qr, mod);
  updMod(2 * pos + 1, mid + 1, r, ql, qr, mod);
  tree[pos].mx = max(tree[2 * pos].mx, tree[2 * pos + 1].mx);
  tree[pos].sum = tree[2 * pos].sum + tree[2 * pos + 1].sum;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  long long n, q;
  cin >> n >> q;
  for (long long i = 1; i <= n; i++) cin >> val[i];
  build(1, 1, n);
  long long a, b, t;
  for (long long i = 1; i <= q; i++) {
    cin >> t;
    if (t == 1) {
      cin >> a >> b;
      cout << query(1, 1, n, a, b) << '\n';
    } else if (t == 2) {
      cin >> a >> b >> t;
      updMod(1, 1, n, a, b, t);
    } else {
      cin >> a >> b;
      val[a] = b;
      updVal(1, 1, n, a);
    }
  }
  return 0;
}
