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;
pair<int, int> segm[1 << 18];
long long segs[1 << 18];
int seg_n;
pair<int, int> maxP(pair<int, int> a, pair<int, int> b) {
  return a.first > b.first ? a : b;
}
void init(int n) {
  seg_n = 1;
  while (seg_n < n) seg_n *= 2;
  for (int i = 0; i < seg_n * 2 - 1; i++) {
    segm[i] = pair<int, int>(0, -1);
    segs[i] = 0;
  }
}
void update(int k, int x) {
  k += seg_n - 1;
  segm[k] = pair<int, int>(x, k - (seg_n - 1));
  segs[k] = x;
  while (k > 0) {
    k = (k - 1) / 2;
    segm[k] = maxP(segm[k * 2 + 1], segm[k * 2 + 2]);
    segs[k] = segs[k * 2 + 1] + segs[k * 2 + 2];
  }
}
pair<int, int> mquery(int a, int b, int k = 0, int l = 0, int r = seg_n) {
  if (r <= a || b <= l)
    return pair<int, int>(0, -1);
  else if (a <= l && r <= b)
    return segm[k];
  else {
    pair<int, int> vl = mquery(a, b, k * 2 + 1, l, (l + r) / 2);
    pair<int, int> vr = mquery(a, b, k * 2 + 2, (l + r) / 2, r);
    return maxP(vl, vr);
  }
}
long long squery(int a, int b, int k = 0, int l = 0, int r = seg_n) {
  if (r <= a || b <= l)
    return 0;
  else if (a <= l && r <= b)
    return segs[k];
  else {
    long long vl = squery(a, b, k * 2 + 1, l, (l + r) / 2);
    long long vr = squery(a, b, k * 2 + 2, (l + r) / 2, r);
    return vl + vr;
  }
}
int main() {
  int n, m, i;
  scanf("%d %d", &n, &m);
  init(n);
  for (i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    update(i, x);
  }
  for (i = 0; i < m; i++) {
    int q;
    scanf("%d", &q);
    if (q == 1) {
      int l, r;
      scanf("%d %d", &l, &r);
      l--;
      printf("%I64d\n", squery(l, r));
    }
    if (q == 2) {
      int l, r, mod;
      scanf("%d %d %d", &l, &r, &mod);
      l--;
      while (1) {
        pair<int, int> pr = mquery(l, r);
        if (pr.first < mod) break;
        int x = pr.first % mod;
        update(pr.second, x);
      }
    }
    if (q == 3) {
      int k, x;
      scanf("%d %d", &k, &x);
      k--;
      update(k, x);
    }
  }
  return 0;
}