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;
int n, m, a[100010], mx[270000];
long long t[270000];
inline void build_tree(int p, int l, int r) {
  if (l == r) {
    t[p] = a[l];
    mx[p] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build_tree(p << 1, l, mid);
  build_tree(p << 1 | 1, mid + 1, r);
  t[p] = t[p << 1] + t[p << 1 | 1];
  mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
}
inline long long query(int p, int l, int r, int ll, int rr) {
  if (l >= ll && r <= rr) return t[p];
  long long res = 0;
  int mid = (l + r) >> 1;
  if (ll <= mid) res += query(p << 1, l, mid, ll, rr);
  if (rr > mid) res += query(p << 1 | 1, mid + 1, r, ll, rr);
  return res;
}
inline void mod(int p, int l, int r, int ll, int rr, int x) {
  if (mx[p] < x) return;
  if (l == r) {
    t[p] %= x;
    mx[p] %= x;
    return;
  }
  int mid = (l + r) >> 1;
  if (ll <= mid) mod(p << 1, l, mid, ll, rr, x);
  if (rr > mid) mod(p << 1 | 1, mid + 1, r, ll, rr, x);
  t[p] = t[p << 1] + t[p << 1 | 1];
  mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
}
inline void cg(int p, int l, int r, int x, int num) {
  if (l == r) {
    t[p] = mx[p] = num;
    return;
  }
  int mid = (l + r) >> 1;
  if (x <= mid)
    cg(p << 1, l, mid, x, num);
  else
    cg(p << 1 | 1, mid + 1, r, x, num);
  t[p] = t[p << 1] + t[p << 1 | 1];
  mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  build_tree(1, 1, n);
  int tp, l, r, x;
  while (m--) {
    scanf("%d%d%d", &tp, &l, &r);
    if (tp == 1) {
      cout << query(1, 1, n, l, r) << endl;
    }
    if (tp == 2) {
      scanf("%d", &x);
      mod(1, 1, n, l, r, x);
    }
    if (tp == 3) {
      cg(1, 1, n, l, r);
    }
  }
  return 0;
}