Problem: At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite sequence of Picks.

Fortunately, Picks remembers how to repair the sequence. Initially he should create an integer array a[1], a[2], ..., a[n]. Then he should perform a sequence of m operations. An operation can be one of the following:

  1. Print operation l, r. Picks should write down the value of <image>. 
  2. Modulo operation l, r, x. Picks should perform assignment a[i] = a[i] mod x for each i (l ≤ i ≤ r). 
  3. Set operation k, x. Picks should set the value of a[k] to x (in other words perform an assignment a[k] = x). 



Can you help Picks to perform the whole sequence of operations?

Input

The first line of input contains two integer: n, m (1 ≤ n, m ≤ 105). The second line contains n integers, separated by space: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 109) — initial value of array elements.

Each of the next m lines begins with a number type <image>. 

  * If type = 1, there will be two integers more in the line: l, r (1 ≤ l ≤ r ≤ n), which correspond the operation 1. 
  * If type = 2, there will be three integers more in the line: l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 109), which correspond the operation 2. 
  * If type = 3, there will be two integers more in the line: k, x (1 ≤ k ≤ n; 1 ≤ x ≤ 109), which correspond the operation 3. 

Output

For each operation 1, please print a line containing the answer. Notice that the answer may exceed the 32-bit integer.

Examples

Input

5 5
1 2 3 4 5
2 3 5 4
3 3 5
1 2 5
2 1 3 3
1 1 3


Output

8
5


Input

10 10
6 9 6 7 6 1 10 10 9 5
1 3 9
2 7 10 9
2 5 10 8
1 4 7
3 3 7
2 7 9 9
1 2 4
1 6 6
1 5 9
3 1 10


Output

49
15
23
1
9

Note

Consider the first testcase:

  * At first, a = {1, 2, 3, 4, 5}. 
  * After operation 1, a = {1, 2, 3, 0, 1}. 
  * After operation 2, a = {1, 2, 5, 0, 1}. 
  * At operation 3, 2 + 5 + 0 + 1 = 8. 
  * After operation 4, a = {1, 2, 2, 0, 1}. 
  * At operation 5, 1 + 2 + 2 = 5. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 4e5, MXN = 1e5 + 10;
long long seg[MAXN], maxd[MAXN], a[MXN], n, m, INF = 1e9 + 1;
void build(long long l = 1, long long r = n + 1, long long id = 0) {
  if (r - 1 == l) {
    maxd[id] = seg[id] = a[l];
    return;
  }
  long long mid = l + r >> 1;
  build(l, mid, id * 2 + 1);
  build(mid, r, id * 2 + 2);
  seg[id] = seg[id * 2 + 1] + seg[id * 2 + 2];
  maxd[id] = max(maxd[id * 2 + 1], maxd[id * 2 + 2]);
}
void upd1(long long x, long long l = 1, long long r = n + 1, long long id = 0) {
  if (l > x || r <= x) return;
  if (r - 1 == l) {
    maxd[id] = seg[id] = a[x];
    return;
  }
  long long mid = l + r >> 1;
  upd1(x, l, mid, id * 2 + 1);
  upd1(x, mid, r, id * 2 + 2);
  seg[id] = seg[id * 2 + 1] + seg[id * 2 + 2];
  maxd[id] = max(maxd[id * 2 + 1], maxd[id * 2 + 2]);
}
void upd2(long long S, long long E, long long val, long long l = 1,
          long long r = n + 1, long long id = 0) {
  if (S >= r || E <= l || maxd[id] < val) return;
  if (r - 1 == l) {
    seg[id] %= val;
    maxd[id] %= val;
    return;
  }
  long long mid = l + r >> 1;
  upd2(S, E, val, l, mid, id * 2 + 1);
  upd2(S, E, val, mid, r, id * 2 + 2);
  seg[id] = seg[id * 2 + 1] + seg[id * 2 + 2];
  maxd[id] = max(maxd[id * 2 + 1], maxd[id * 2 + 2]);
}
long long get(long long S, long long E, long long l = 1, long long r = n + 1,
              long long id = 0) {
  if (S >= r || E <= l) return 0;
  if (S <= l && E >= r) return seg[id];
  long long mid = l + r >> 1;
  return get(S, E, l, mid, id * 2 + 1) + get(S, E, mid, r, id * 2 + 2);
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  long long type, l, r, x, y;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  build();
  for (long long i = 0; i < m; i++) {
    cin >> type;
    if (type == 1) {
      cin >> l >> r;
      cout << get(l, r + 1) << '\n';
    } else if (type == 2) {
      cin >> l >> r >> x;
      upd2(l, r + 1, x);
    } else {
      cin >> x >> y;
      a[x] = y;
      upd1(x);
    }
  }
}