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;
struct __timestamper {};
const int MAXN = 100000;
const int MAXSZ = 1 << 18;
long long trees[MAXSZ + 10];
int treem[MAXSZ + 10];
int lst;
void update(int x) {
  trees[x] = trees[2 * x] + trees[2 * x + 1];
  treem[x] = max(treem[2 * x], treem[2 * x + 1]);
}
void setv(int k, int x) {
  k += lst;
  trees[k] = treem[k] = x;
  while (k /= 2) {
    update(k);
  }
}
long long get(int v, int l, int r, int L, int R) {
  if (r < L || R < l) return 0;
  if (L <= l && r <= R) return trees[v];
  return get(2 * v, l, (l + r) / 2, L, R) +
         get(2 * v + 1, (l + r) / 2 + 1, r, L, R);
}
void update(int v, int l, int r, int L, int R, int x) {
  if (r < L || R < l) return;
  if (treem[v] < x) return;
  if (v >= lst) {
    trees[v] %= x;
    treem[v] = trees[v];
    return;
  }
  update(2 * v, l, (l + r) / 2, L, R, x);
  update(2 * v + 1, (l + r) / 2 + 1, r, L, R, x);
  update(v);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  lst = 2;
  for (; lst < n; lst *= 2)
    ;
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    setv(i, x);
  }
  for (int i = 0; i < m; i++) {
    int ty;
    scanf("%d", &ty);
    if (ty == 1) {
      int l, r;
      scanf("%d %d", &l, &r);
      printf(
          "%lld"
          "\n",
          get(1, 0, lst - 1, l - 1, r - 1));
    } else if (ty == 2) {
      int l, r, x;
      scanf("%d %d %d", &l, &r, &x);
      update(1, 0, lst - 1, l - 1, r - 1, x);
    } else {
      assert(ty == 3);
      int k, x;
      scanf("%d %d", &k, &x);
      setv(k - 1, x);
    }
  }
  return 0;
}