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 int N = 100010;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long n, m, a[N], op, x, y, z;
struct SegmentTree {
  long long l, r, sum, maxn;
} tree[N << 2];
void pushup(int k) {
  tree[k].sum = tree[k << 1].sum + tree[k << 1 | 1].sum;
  tree[k].maxn = max(tree[k << 1].maxn, tree[k << 1 | 1].maxn);
}
void build(int k, int l, int r) {
  tree[k].l = l, tree[k].r = r;
  if (l == r) {
    tree[k].sum = tree[k].maxn = a[l];
    return;
  }
  int mid = (l + r) / 2;
  build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r);
  pushup(k);
}
void changemod(int k, int ql, int qr, long long mod) {
  if (tree[k].maxn < mod) return;
  if (ql <= tree[k].l && tree[k].r <= qr && tree[k].l == tree[k].r) {
    tree[k].sum %= mod, tree[k].maxn %= mod;
    return;
  }
  int mid = (tree[k].l + tree[k].r) / 2;
  if (ql <= mid) changemod(k << 1, ql, qr, mod);
  if (mid < qr) changemod(k << 1 | 1, ql, qr, mod);
  pushup(k);
}
void modify(int k, int q, long long v) {
  if (tree[k].l > q || q > tree[k].r) return;
  if (tree[k].l == tree[k].r) {
    tree[k].sum = tree[k].maxn = v;
    return;
  }
  int mid = (tree[k].l + tree[k].r) / 2;
  if (q <= mid)
    modify(k << 1, q, v);
  else
    modify(k << 1 | 1, q, v);
  pushup(k);
}
long long query(int k, int ql, int qr) {
  long long res = 0;
  if (ql <= tree[k].l && tree[k].r <= qr) return tree[k].sum;
  int mid = (tree[k].l + tree[k].r) / 2;
  if (ql <= mid) res += query(k << 1, ql, qr);
  if (mid < qr) res += query(k << 1 | 1, ql, qr);
  return res;
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  build(1, 1, n);
  while (m--) {
    op = read();
    if (op == 1) {
      x = read(), y = read();
      printf("%lld\n", query(1, x, y));
    }
    if (op == 2) {
      x = read(), y = read(), z = read();
      changemod(1, x, y, z);
    }
    if (op == 3) {
      x = read(), y = read();
      modify(1, x, y);
    }
  }
  return 0;
}