#include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
struct edge {
  long long max;
  long long sum;
} tree[400010];
int a[100010];
long long query(int x, int l, int r, int L, int R) {
  if (L <= l && R >= r) return tree[x].sum;
  int mid = (l + r) >> 1;
  if (R <= mid)
    return query(x << 1, l, mid, L, R);
  else if (L > mid)
    return query(x << 1 | 1, mid + 1, r, L, R);
  else
    return query(x << 1, l, mid, L, R) + query(x << 1 | 1, mid + 1, r, L, R);
}
void change1(int x, int l, int r, int L, int R, int mod) {
  if (L <= l && R >= r) {
    if (tree[x].max < mod) return;
    if (l == r) {
      tree[x].max = tree[x].sum = tree[x].max %= mod;
      return;
    }
  }
  int mid = (l + r) >> 1;
  if (L <= mid) change1(x << 1, l, mid, L, R, mod);
  if (R > mid) change1(x << 1 | 1, mid + 1, r, L, R, mod);
  tree[x].max = max(tree[x << 1].max, tree[x << 1 | 1].max);
  tree[x].sum = tree[x << 1].sum + tree[x << 1 | 1].sum;
}
void change2(int x, int l, int r, int u, int y) {
  if (l == r) {
    tree[x].max = y;
    tree[x].sum = y;
    return;
  }
  int mid = (l + r) >> 1;
  if (u <= mid)
    change2(x << 1, l, mid, u, y);
  else
    change2(x << 1 | 1, mid + 1, r, u, y);
  tree[x].max = max(tree[x << 1].max, tree[x << 1 | 1].max);
  tree[x].sum = tree[x << 1].sum + tree[x << 1 | 1].sum;
}
void build(int x, int l, int r) {
  if (l == r) {
    tree[x].max = a[l];
    tree[x].sum = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(x << 1, l, mid);
  build(x << 1 | 1, mid + 1, r);
  tree[x].max = max(tree[x << 1].max, tree[x << 1 | 1].max);
  tree[x].sum = tree[x << 1].sum + tree[x << 1 | 1].sum;
}
int read() {
  int x = 0, f = 1;
  char c;
  c = getchar();
  if (c == ' ') return x * f;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
int main() {
  cin >> n >> m;
  for (i = 1; i <= n; i++) a[i] = read();
  build(1, 1, n);
  int opt, a, b, c;
  while (m--) {
    opt = read();
    if (opt == 1) {
      a = read();
      b = read();
      cout << query(1, 1, n, a, b) << endl;
    }
    if (opt == 2) {
      a = read();
      b = read();
      c = read();
      change1(1, 1, n, a, b, c);
    }
    if (opt == 3) {
      a = read();
      b = read();
      change2(1, 1, n, a, b);
    }
  }
}
