#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e8;
const int Max = 1e5 + 10;
struct Node {
  int l, r;
  long long sum;
  long long max_val;
} node[Max << 2];
void push_up(int num) {
  node[num].sum = node[num << 1].sum + node[num << 1 | 1].sum;
  node[num].max_val = max(node[num << 1].max_val, node[num << 1 | 1].max_val);
}
void build(int l, int r, int num) {
  node[num].l = l;
  node[num].r = r;
  if (l == r) {
    scanf("%lld", &node[num].sum);
    node[num].max_val = node[num].sum;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, num << 1);
  build(mid + 1, r, num << 1 | 1);
  push_up(num);
}
void upData(int l, int r, long long x, int num) {
  if (node[num].max_val < x) return;
  if (node[num].l == node[num].r) {
    node[num].max_val = node[num].sum = node[num].sum % x;
    return;
  }
  int mid = (node[num].l + node[num].r) >> 1;
  if (l <= mid) upData(l, r, x, num << 1);
  if (r > mid) upData(l, r, x, num << 1 | 1);
  push_up(num);
}
void upData(int pos, long long val, int num) {
  if (node[num].l == node[num].r) {
    node[num].max_val = node[num].sum = val;
    return;
  }
  int mid = (node[num].l + node[num].r) >> 1;
  if (pos <= mid) upData(pos, val, num << 1);
  if (pos > mid) upData(pos, val, num << 1 | 1);
  push_up(num);
}
long long query(int l, int r, int num) {
  if (l <= node[num].l && node[num].r <= r) return node[num].sum;
  int mid = (node[num].l + node[num].r) >> 1;
  long long ans = 0;
  if (l <= mid) ans += query(l, r, num << 1);
  if (r > mid) ans += query(l, r, num << 1 | 1);
  return ans;
}
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) != EOF) {
    build(1, n, 1);
    while (m--) {
      int type, a, b;
      long long x;
      scanf("%d%d%d", &type, &a, &b);
      if (type == 1)
        printf("%lld\n", query(a, b, 1));
      else if (type == 2)
        scanf("%lld", &x), upData(a, b, x, 1);
      else
        upData(a, b, 1);
    }
  }
  return 0;
}
