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>
const int N = 100005;
using namespace std;
long long sm[N << 1];
int lc[N << 1], rc[N << 1], mx[N << 1], root, Tcnt;
int n, m, a[N];
void pup(int u) {
  mx[u] = max(mx[lc[u]], mx[rc[u]]);
  sm[u] = sm[lc[u]] + sm[rc[u]];
}
void build(int &u, int l, int r) {
  if (!u) u = ++Tcnt;
  if (l == r) {
    mx[u] = a[l];
    sm[u] = a[l];
    return;
  }
  int mid = (l + r) / 2;
  build(lc[u], l, mid);
  build(rc[u], mid + 1, r);
  pup(u);
}
void change(int u, int l, int r, int p, int c) {
  if (l == r) {
    mx[u] = c;
    sm[u] = c;
    return;
  }
  int mid = (l + r) / 2;
  if (p <= mid)
    change(lc[u], l, mid, p, c);
  else
    change(rc[u], mid + 1, r, p, c);
  pup(u);
}
void dfs(int u, int l, int r, int x) {
  if (mx[u] < x) return;
  if (l == r) {
    mx[u] %= x;
    sm[u] %= x;
    return;
  }
  int mid = (l + r) / 2;
  dfs(lc[u], l, mid, x);
  dfs(rc[u], mid + 1, r, x);
  pup(u);
}
void mod(int u, int l, int r, int ml, int mr, int x) {
  if (l == ml && r == mr) {
    dfs(u, l, r, x);
    return;
  }
  int mid = (l + r) / 2;
  if (mr <= mid)
    mod(lc[u], l, mid, ml, mr, x);
  else if (ml > mid)
    mod(rc[u], mid + 1, r, ml, mr, x);
  else
    mod(lc[u], l, mid, ml, mid, x), mod(rc[u], mid + 1, r, mid + 1, mr, x);
  pup(u);
}
long long query(int u, int l, int r, int ql, int qr) {
  if (l == ql && r == qr) return sm[u];
  int mid = (l + r) / 2;
  if (qr <= mid)
    return query(lc[u], l, mid, ql, qr);
  else if (ql > mid)
    return query(rc[u], mid + 1, r, ql, qr);
  else
    return query(lc[u], l, mid, ql, mid) +
           query(rc[u], mid + 1, r, mid + 1, qr);
}
int main() {
  int o, l, r, x;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  build(root, 1, n);
  while (m--) {
    scanf("%d", &o);
    if (o == 1)
      scanf("%d%d", &l, &r), printf("%I64d\n", query(root, 1, n, l, r));
    if (o == 2) scanf("%d%d%d", &l, &r, &x), mod(root, 1, n, l, r, x);
    if (o == 3) scanf("%d%d", &l, &x), change(root, 1, n, l, x);
  }
  return 0;
}