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 node {
  long long l, r;
  long long mx;
  long long sum;
} tr[100005 * 4];
long long n, m;
long long val[100005];
long long max(long long x, long long y) { return x > y ? x : y; }
void update(long long k) {
  tr[k].sum = tr[(k << 1)].sum + tr[(k << 1 | 1)].sum;
  tr[k].mx = max(tr[(k << 1)].mx, tr[(k << 1 | 1)].mx);
}
void build(long long k, long long l, long long r) {
  tr[k].l = l;
  tr[k].r = r;
  if (l == r) {
    tr[k].mx = tr[k].sum = val[l];
    return;
  }
  long long mid = (l + r) >> 1;
  build((k << 1), l, mid);
  build((k << 1 | 1), mid + 1, r);
  update(k);
}
void modify(long long k, long long x, long long del) {
  if (tr[k].l == tr[k].r) {
    tr[k].sum = tr[k].mx = del;
    return;
  }
  long long mid = (tr[k].l + tr[k].r) >> 1;
  if (x <= mid)
    modify((k << 1), x, del);
  else
    modify((k << 1 | 1), x, del);
  update(k);
}
void modify_mod(long long k, long long l, long long r, long long del) {
  if (tr[k].mx < del) return;
  if (tr[k].l == tr[k].r) {
    tr[k].sum %= del;
    tr[k].mx %= del;
    return;
  }
  long long mid = (tr[k].l + tr[k].r) >> 1;
  if (l <= mid) modify_mod((k << 1), l, r, del);
  if (r > mid) modify_mod((k << 1 | 1), l, r, del);
  update(k);
}
long long query(long long k, long long l, long long r) {
  if (tr[k].l >= l && tr[k].r <= r) return tr[k].sum;
  long long mid = (tr[k].l + tr[k].r) >> 1, ret = 0;
  if (l <= mid) ret += query((k << 1), l, r);
  if (r > mid) ret += query((k << 1 | 1), l, r);
  return ret;
}
int main() {
  scanf("%lld%lld", &n, &m);
  for (long long i = 1; i <= n; ++i) scanf("%lld", &val[i]);
  build(1, 1, n);
  for (long long i = 1; i <= m; ++i) {
    long long op, x, y, z;
    scanf("%lld", &op);
    switch (op) {
      case 1:
        scanf("%lld%lld", &x, &y);
        printf("%lld\n", query(1, x, y));
        break;
      case 2:
        scanf("%lld%lld%lld", &x, &y, &z);
        modify_mod(1, x, y, z);
        break;
      case 3:
        scanf("%lld%lld", &x, &z);
        modify(1, x, z);
        break;
    }
  }
  return 0;
}