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 + 10;
struct {
  long long val[maxn << 2], maxnum[maxn << 2];
  long long a[maxn], n;
  void pushup(long long rt) {
    val[rt] = val[rt << 1] + val[rt << 1 | 1];
    maxnum[rt] = max(maxnum[rt << 1], maxnum[rt << 1 | 1]);
  }
  void build(long long l, long long r, long long rt) {
    if (l == r) {
      cin >> val[rt];
      maxnum[rt] = val[rt];
      return;
    }
    long long mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  void updata(long long L, long long C, long long l, long long r,
              long long rt) {
    if (l == r && l == L) {
      val[rt] = C;
      maxnum[rt] = C;
      return;
    }
    long long mid = (l + r) >> 1;
    if (L <= mid) {
      updata(L, C, l, mid, rt << 1);
    } else {
      updata(L, C, mid + 1, r, rt << 1 | 1);
    }
    pushup(rt);
  }
  void modupdata(long long L, long long R, long long c, long long l,
                 long long r, long long rt) {
    if (L <= l && R >= r && maxnum[rt] < c) {
      return;
    }
    if (L <= l && R >= r && l == r) {
      val[rt] %= c;
      maxnum[rt] = val[rt];
      return;
    }
    long long mid = (l + r) >> 1;
    if (L <= mid) modupdata(L, R, c, l, mid, rt << 1);
    if (R > mid) modupdata(L, R, c, mid + 1, r, rt << 1 | 1);
    pushup(rt);
  }
  long long query(long long L, long long R, long long l, long long r,
                  long long rt) {
    if (L <= l && R >= r) {
      return val[rt];
    }
    long long mid = (l + r) >> 1;
    long long ans = 0;
    if (L <= mid) ans += query(L, R, l, mid, rt << 1);
    if (R > mid) ans += query(L, R, mid + 1, r, rt << 1 | 1);
    return ans;
  }
} cctree;
int main() {
  long long n, m;
  cin >> n >> m;
  cctree.n = n;
  cctree.build(1, n, 1);
  for (long long j = 0; j < m; j++) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long x, y;
      cin >> x >> y;
      cout << cctree.query(x, y, 1, n, 1) << endl;
    } else if (type == 2) {
      long long x, y, mod;
      cin >> x >> y >> mod;
      cctree.modupdata(x, y, mod, 1, n, 1);
    } else {
      long long x, y;
      cin >> x >> y;
      cctree.updata(x, y, 1, n, 1);
    }
  }
}