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 = 1e5 + 5;
long long n, m;
struct Tree {
  long long ext, sum;
} t[Maxn << 2];
void Maintain(long long p) {
  t[p].ext = max(t[p << 1].ext, t[p << 1 | 1].ext);
  t[p].sum = t[p << 1].sum + t[p << 1 | 1].sum;
}
void Build_Tree(long long p, long long l, long long r) {
  if (l == r) {
    scanf("%lld", &t[p].ext);
    t[p].sum = t[p].ext;
    return;
  }
  long long mid = (l + r) >> 1;
  Build_Tree(p << 1, l, mid);
  Build_Tree(p << 1 | 1, mid + 1, r);
  Maintain(p);
}
void Modify_Ths(long long p, long long l, long long r, long long x,
                long long v) {
  if (l == r) {
    t[p].ext = v;
    t[p].sum = v;
    return;
  }
  long long mid = (l + r) >> 1;
  if (mid >= x)
    Modify_Ths(p << 1, l, mid, x, v);
  else
    Modify_Ths(p << 1 | 1, mid + 1, r, x, v);
  Maintain(p);
}
void Modify_Mod(long long p, long long l, long long r, long long x, long long y,
                long long m) {
  if (t[p].ext < m) return;
  if (l == r) {
    t[p].ext %= m;
    t[p].sum %= m;
    return;
  }
  long long mid = (l + r) >> 1;
  if (mid >= x) Modify_Mod(p << 1, l, mid, x, y, m);
  if (mid < y) Modify_Mod(p << 1 | 1, mid + 1, r, x, y, m);
  Maintain(p);
}
long long Query(long long p, long long l, long long r, long long x,
                long long y) {
  if (l > y || r < x) return 0;
  if (l >= x && r <= y) return t[p].sum;
  long long mid = (l + r) >> 1, ret = 0;
  if (mid >= x) ret += Query(p << 1, l, mid, x, y);
  if (mid < y) ret += Query(p << 1 | 1, mid + 1, r, x, y);
  return ret;
}
signed main() {
  scanf("%lld %lld", &n, &m);
  Build_Tree(1, 1, n);
  for (long long i = 0, t, l, r, p; i < m; ++i) {
    scanf("%lld", &t);
    if (t != 3) scanf("%lld %lld", &l, &r);
    if (t == 1)
      printf("%lld\n", Query(1, 1, n, l, r));
    else if (t == 2) {
      scanf("%lld", &p);
      Modify_Mod(1, 1, n, l, r, p);
    } else {
      scanf("%lld %lld", &t, &p);
      Modify_Ths(1, 1, n, t, p);
    }
  }
  return 0;
}