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 int N = 1e5 + 5;
int n, m;
int mx_tree[N << 2];
long long sm_tree[N << 2];
int a[N];
int t, x, l, r;
void build(int node = 1, int s = 0, int e = n - 1) {
  if (s == e) {
    mx_tree[node] = sm_tree[node] = a[s];
    return;
  }
  int md = (s + e) >> 1;
  build(node << 1, s, md);
  build(node << 1 | 1, md + 1, e);
  sm_tree[node] = sm_tree[node << 1] + sm_tree[node << 1 | 1];
  mx_tree[node] = max(mx_tree[node << 1], mx_tree[node << 1 | 1]);
}
void upd2(int node, int s, int e, int l, int r, int x, bool f) {
  if (r < s || e < l || (f && mx_tree[node] < x)) {
    return;
  }
  if (s == e) {
    if (f)
      sm_tree[node] = mx_tree[node] = (sm_tree[node] % x);
    else
      sm_tree[node] = mx_tree[node] = (x);
    return;
  }
  int md = (s + e) >> 1;
  upd2(node << 1, s, md, l, r, x, f);
  upd2(node << 1 | 1, md + 1, e, l, r, x, f);
  sm_tree[node] = sm_tree[node << 1] + sm_tree[node << 1 | 1];
  mx_tree[node] = max(mx_tree[node << 1], mx_tree[node << 1 | 1]);
}
long long qry(int node, int s, int e, int l, int r) {
  if (r < s || e < l) return 0;
  if (l <= s && e <= r) return sm_tree[node];
  int md = (s + e) >> 1;
  return qry(node << 1, s, md, l, r) + qry(node << 1 | 1, md + 1, e, l, r);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  build();
  while (m--) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d%d", &l, &r);
      printf("%lld\n", qry(1, 0, n - 1, l - 1, r - 1));
    } else if (t == 2) {
      scanf("%d%d%d", &l, &r, &x);
      upd2(1, 0, n - 1, l - 1, r - 1, x, 1);
    } else {
      scanf("%d%d", &l, &x);
      upd2(1, 0, n - 1, l - 1, l - 1, x, 0);
    }
  }
  return 0;
}