#include <bits/stdc++.h>
int take() {
  int n;
  scanf("%d", &n);
  return n;
}
double ttake() {
  double n;
  scanf("%lf", &n);
  return n;
}
long long takes() {
  long long n;
  scanf("%lld", &n);
  return n;
}
int cas;
using namespace std;
bool approximatelyEqual(float a, float b, float epsilon) {
  return fabs(a - b) <= ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * epsilon);
}
bool essentiallyEqual(float a, float b, float epsilon) {
  return fabs(a - b) <= ((fabs(a) > fabs(b) ? fabs(b) : fabs(a)) * epsilon);
}
bool definitelyGreaterThan(float a, float b, float epsilon) {
  return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * epsilon);
}
bool definitelyLessThan(float a, float b, float epsilon) {
  return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) * epsilon);
}
long long tr[4 * 100005], mx[4 * 100005], arr[100005];
void built(int s, int e, int n) {
  if (s > e) return;
  if (s == e) {
    tr[n] = arr[s];
    mx[n] = arr[s];
    return;
  }
  int m = s + (e - s) / 2;
  built(s, m, 2 * n);
  built(m + 1, e, 2 * n + 1);
  tr[n] = tr[2 * n] + tr[2 * n + 1];
  mx[n] = max(mx[2 * n], mx[2 * n + 1]);
}
void upd(int s, int e, int l, int r, int x, int n) {
  if (s > e || e < l || s > r || mx[n] < x) return;
  if (s == e) {
    mx[n] %= x;
    tr[n] %= x;
    return;
  }
  int m = s + (e - s) / 2;
  upd(s, m, l, r, x, 2 * n);
  upd(m + 1, e, l, r, x, 2 * n + 1);
  tr[n] = tr[2 * n] + tr[2 * n + 1];
  mx[n] = max(mx[2 * n], mx[2 * n + 1]);
}
void sets(int s, int e, int l, int r, int x, int n) {
  if (s > e || e < l || s > r) return;
  if (s == e && s == l) {
    mx[n] = x;
    tr[n] = x;
    return;
  }
  int m = s + (e - s) / 2;
  sets(s, m, l, r, x, 2 * n);
  sets(m + 1, e, l, r, x, 2 * n + 1);
  tr[n] = tr[2 * n] + tr[2 * n + 1];
  mx[n] = max(mx[2 * n], mx[2 * n + 1]);
}
long long query(int s, int e, int l, int r, int n) {
  if (s > e || s > r || e < l) return 0;
  if (s >= l && e <= r) return tr[n];
  int m = s + (e - s) / 2;
  return (query(s, m, l, r, 2 * n) + query(m + 1, e, l, r, 2 * n + 1));
}
int main() {
  int tc = 1;
  while (tc--) {
    int n = take(), q = take();
    for (int i = 1; i <= n; i += 1) arr[i] = take();
    built(1, n, 1);
    while (q--) {
      int ty = take();
      if (ty == 1) {
        int l = take(), r = take();
        printf("%lld\n", query(1, n, l, r, 1));
      } else if (ty == 2) {
        int l = take(), r = take(), x = take();
        upd(1, n, l, r, x, 1);
      } else {
        int l = take(), r = l, x = take();
        sets(1, n, l, r, x, 1);
      }
    }
  }
  { return 0; };
}
