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;
int const N = 3312312;
int const INF = 1e9 + 7;
int n, m, a[N];
long long s[N];
pair<int, int> t[N];
void build(int v, int tl, int tr) {
  if (tl == tr) {
    t[v] = {a[tl], tl};
    s[v] = a[tl];
  } else {
    int tm = (tl + tr) >> 1;
    build(v + v, tl, tm);
    build(v + v + 1, tm + 1, tr);
    s[v] = s[v + v] + s[v + v + 1];
    t[v] = max(t[v + v], t[v + v + 1]);
  }
}
long long getsum(int v, int tl, int tr, int l, int r) {
  if (l > r) return 0;
  if (tl == l && r == tr)
    return s[v];
  else {
    int tm = (tl + tr) >> 1;
    return getsum(v + v, tl, tm, l, min(r, tm)) +
           getsum(v + v + 1, tm + 1, tr, max(l, tm + 1), r);
  }
}
pair<int, int> getmax(int v, int tl, int tr, int l, int r) {
  if (l > r) return {-1, -1};
  if (tl == l && tr == r)
    return t[v];
  else {
    int tm = (tl + tr) >> 1;
    return max(getmax(v + v, tl, tm, l, min(r, tm)),
               getmax(v + v + 1, tm + 1, tr, max(l, tm + 1), r));
  }
}
void update(int v, int tl, int tr, int pos, int val) {
  if (tl == tr) {
    s[v] = val;
    t[v] = {val, tl};
  } else {
    int tm = (tl + tr) >> 1;
    if (pos <= tm)
      update(v + v, tl, tm, pos, val);
    else
      update(v + v + 1, tm + 1, tr, pos, val);
    t[v] = max(t[v + v], t[v + v + 1]);
    s[v] = s[v + v] + s[v + v + 1];
  }
}
int main() {
  scanf("%d %d", &n, &m);
  for (int c = 1; c <= n; c++) {
    scanf("%d", &a[c]);
  }
  build(1, 1, n);
  pair<int, int> x = getmax(1, 1, n, 1, n);
  for (int c = 1; c <= m; c++) {
    int type, l, r, x, pos;
    scanf("%d", &type);
    if (type == 1) {
      scanf("%d %d", &l, &r);
      printf("%I64d\n", getsum(1, 1, n, l, r));
    } else if (type == 2) {
      scanf("%d %d %d", &l, &r, &x);
      while (1) {
        pair<int, int> cur = getmax(1, 1, n, l, r);
        if (cur.first >= x) {
          update(1, 1, n, cur.second, cur.first % x);
        } else
          break;
      }
    } else {
      scanf("%d %d", &pos, &x);
      update(1, 1, n, pos, x);
    }
  }
  return 0;
}