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 SegTree {
  pair<int, int> seg[(1 << 18) * 2 - 1];
  SegTree() {
    for (int i = 0; i < (1 << 18) * 2 - 1; i++) seg[i] = pair<int, int>(0, 0);
  }
  void update(int i, pair<int, int> x) {
    i += (1 << 18) - 1;
    seg[i] = x;
    while (i > 0) {
      i = (i - 1) / 2;
      seg[i] = max(seg[i * 2 + 1], seg[i * 2 + 2]);
    }
  }
  pair<int, int> query(int a, int b, int k = 0, int l = 0, int r = (1 << 18)) {
    if (r <= a || b <= l) return pair<int, int>(0, 0);
    if (a <= l && r <= b) return seg[k];
    return max(query(a, b, k * 2 + 1, l, (l + r) / 2),
               query(a, b, k * 2 + 2, (l + r) / 2, r));
  }
};
struct BIT {
  int n;
  vector<long long> xs;
  BIT(int n) : n(n) { xs.resize(n + 1); }
  void add(int i, int v) {
    for (int x = i + 1; x <= n; x += x & -x) xs[x] += v;
  }
  long long sum(int i) {
    long long s = 0;
    for (int x = i + 1; x > 0; x -= x & -x) s += xs[x];
    return s;
  }
  long long sum(int a, int b) { return sum(b) - sum(a - 1); }
};
int N, Q;
int A[100000];
BIT bit(100001);
SegTree seg;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> N >> Q;
  for (int i = 0; i < (N); i++)
    cin >> A[i], bit.add(i, A[i]), seg.update(i, pair<int, int>(A[i], i));
  for (int i = 0; i < (Q); i++) {
    int t;
    cin >> t;
    if (t == 1) {
      int l, r;
      cin >> l >> r;
      l--, r--;
      cout << bit.sum(l, r) << "\n";
    } else if (t == 2) {
      int l, r, x;
      cin >> l >> r >> x;
      l--, r--;
      while (true) {
        pair<int, int> p = seg.query(l, r + 1);
        int val = p.first, pos = p.second;
        if (val < x) break;
        bit.add(pos, -val);
        val %= x;
        seg.update(pos, pair<int, int>(val, pos));
        bit.add(pos, val);
      }
    } else {
      int k, x;
      cin >> k >> x;
      k--;
      bit.add(k, -seg.query(k, k + 1).first);
      bit.add(k, x);
      seg.update(k, pair<int, int>(x, k));
    }
  }
  return 0;
}