#include <bits/stdc++.h>
using namespace std;
int n, m;
const int size = 311111;
int ans[size], idx[size], a[size];
long long sum[size];
void adp(int p) {
  int x = p * 2;
  if (ans[x] < ans[x + 1]) x++;
  ans[p] = ans[x];
  idx[p] = idx[x];
  sum[p] = sum[x] + sum[x ^ 1];
}
void init(int p, int l, int r) {
  if (l == r) {
    sum[p] = ans[p] = a[l];
    idx[p] = l;
    return;
  }
  int mid = (l + r) / 2;
  init(p * 2, l, mid);
  init(p * 2 + 1, mid + 1, r);
  adp(p);
}
void change(int p, int l, int r, int x, int num) {
  if (l == r) {
    sum[p] = ans[p] = num;
    return;
  }
  int mid = (l + r) / 2;
  if (mid >= x)
    change(p * 2, l, mid, x, num);
  else
    change(p * 2 + 1, mid + 1, r, x, num);
  adp(p);
}
long long get(int p, int l, int r, int L, int R) {
  if (L <= l && R >= r) return sum[p];
  if (L > r || R < l) return 0;
  int mid = (l + r) / 2;
  return get(p * 2, l, mid, L, R) + get(p * 2 + 1, mid + 1, r, L, R);
}
void pause() {
  for (int i = 1; i <= n; i++) cout << get(1, 1, n, i, i) << ' ';
  cout << endl;
  int a;
  cin >> a;
}
void deal(int p, int l, int r, int L, int R, int x) {
  if (L <= l && R >= r) {
    while (ans[p] >= x) {
      change(1, 1, n, idx[p], ans[p] % x);
    }
    return;
  }
  if (L > r || R < l) return;
  int mid = (l + r) / 2;
  deal(p * 2, l, mid, L, R, x);
  deal(p * 2 + 1, mid + 1, r, L, R, x);
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  init(1, 1, n);
  while (m--) {
    int t, l, r, x;
    cin >> t;
    if (t == 1) {
      cin >> l >> r;
      cout << get(1, 1, n, l, r) << endl;
    } else if (t == 2) {
      cin >> l >> r >> x;
      deal(1, 1, n, l, r, x);
    } else if (t == 3) {
      cin >> l >> x;
      change(1, 1, n, l, x);
    }
  }
}
