#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> t[5000000];
pair<long long, long long> lz[5000000];
int n, nb, n1, m, k, l, r;
int so;
bool test;
string s;
set<int> st;
map<int, int> mapp;
void merged(int node, int l = 0, int r = 0) {
  t[node].first = t[2 * node].first + t[2 * node + 1].first;
  t[node].second = max(t[2 * node].second, t[2 * node + 1].second);
}
void go(int node, int l, int r, int d) {
  if (t[node].second < d) return;
  if (l == r) {
    t[node].first %= d;
    t[node].second %= d;
    return;
  }
  int mid = (l + r) / 2;
  go(2 * node, l, mid, d);
  go(2 * node + 1, mid + 1, r, d);
  merged(node, l, r);
}
void update1(int node, int l1, int r1, int l, int r, int d) {
  if ((l1 > r) || (r1 < l)) return;
  if ((l <= l1) && (r1 <= r)) {
    go(node, l1, r1, d);
    return;
  }
  int mid = (l1 + r1) / 2;
  update1(2 * node, l1, mid, l, r, d);
  update1(2 * node + 1, mid + 1, r1, l, r, d);
  merged(node, l1, r1);
}
void update2(int a, int d) {
  t[nb + a] = make_pair(d, d);
  int k = (nb + a) / 2;
  while (k) {
    merged(k);
    k >>= 1;
  }
}
long long query(int node, int l1, int r1, int l, int r) {
  if ((l1 > r) || (r1 < l)) return 0ll;
  if ((l <= l1) && (r1 <= r)) {
    return t[node].first;
  }
  int mid = (l1 + r1) / 2;
  long long a = query(2 * node, l1, mid, l, r);
  long long b = query(2 * node + 1, mid + 1, r1, l, r);
  merged(node, l1, r1);
  return a + b;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  nb = 1;
  int k = n - 1;
  while (k) {
    k >>= 1, nb <<= 1;
  }
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    t[nb + i] = make_pair(a, a);
  }
  for (int i = nb - 1; i > 0; i--) merged(i);
  for (int i = 0; i < m; i++) {
    int a, b, c, d;
    cin >> a;
    if (a == 1) {
      cin >> b >> c;
      cout << query(1, 0, nb - 1, b - 1, c - 1) << '\n';
    } else if (a == 2) {
      cin >> b >> c >> d;
      update1(1, 0, nb - 1, b - 1, c - 1, d);
    } else {
      cin >> b >> c;
      update2(b - 1, c);
    }
  }
}
