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;
vector<long long> tree, a, tree1;
void build(long long v, long long l, long long r) {
  if (r - l == 1) {
    tree[v] = tree1[v] = a[l];
    return;
  }
  long long mid = (l + r) / 2;
  build(2 * v + 1, l, mid);
  build(2 * v + 2, mid, r);
  tree[v] = tree[2 * v + 1] + tree[2 * v + 2];
  tree1[v] = max(tree1[2 * v + 1], tree1[2 * v + 2]);
}
void update1(long long v, long long l, long long r, long long ql, long long qr,
             long long x) {
  if (ql >= r || qr <= l || tree1[v] < x) return;
  if (l == r - 1) {
    tree[v] = tree1[v] = tree[v] % x;
    return;
  }
  long long mid = (l + r) / 2;
  update1(2 * v + 1, l, mid, ql, qr, x);
  update1(2 * v + 2, mid, r, ql, qr, x);
  tree[v] = tree[2 * v + 1] + tree[2 * v + 2];
  tree1[v] = max(tree1[2 * v + 1], tree1[2 * v + 2]);
}
void update(long long v, long long l, long long r, long long ind,
            long long val) {
  if (l > ind || r <= ind) return;
  if (r - l == 1) {
    tree[v] = tree1[v] = val;
    return;
  }
  long long mid = (l + r) / 2;
  update(2 * v + 1, l, mid, ind, val);
  update(2 * v + 2, mid, r, ind, val);
  tree[v] = tree[2 * v + 1] + tree[2 * v + 2];
  tree1[v] = max(tree[2 * v + 1], tree[2 * v + 2]);
}
long long get(long long v, long long l, long long r, long long ql,
              long long qr) {
  if (r <= ql || l >= qr) return 0;
  if (r <= qr && l >= ql) return tree[v];
  long long mid = (l + r) / 2;
  return get(2 * v + 1, l, mid, ql, qr) + get(2 * v + 2, mid, r, ql, qr);
}
int main() {
  long long n, q;
  cin >> n >> q;
  a.resize(n), tree.resize(4 * n, 0), tree1.resize(4 * n, -1);
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
  }
  build(0, 0, n);
  for (long long i = 0; i < q; ++i) {
    long long t;
    cin >> t;
    if (t == 2) {
      long long l, r, x;
      cin >> l >> r >> x;
      update1(0, 0, n, l - 1, r, x);
    } else if (t == 3) {
      long long ind, val;
      cin >> ind >> val;
      update(0, 0, n, ind - 1, val);
    } else {
      long long l, r;
      cin >> l >> r;
      cout << get(0, 0, n, l - 1, r) << endl;
    }
  }
}