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 maxn = 111111;
int a[maxn];
struct Tree {
  Tree *pl, *pr;
  int l, r;
  int mx;
  long long sum;
  Tree() {}
  ~Tree() {
    if (pl) pl->~Tree();
    if (pr) pr->~Tree();
    delete this;
  }
  void update() {
    sum = pl->sum + pr->sum;
    mx = max(pl->mx, pr->mx);
  }
  Tree(int l, int r) : l(l), r(r) {
    if (l == r) {
      sum = mx = a[l];
      return;
    }
    int m = (l + r) >> 1;
    pl = new Tree(l, m);
    pr = new Tree(m + 1, r);
    update();
  }
  long long query(int L, int R) {
    if (L <= l && r <= R) return sum;
    int m = (l + r) >> 1;
    long long ans = 0;
    if (L <= m) ans += pl->query(L, R);
    if (R > m) ans += pr->query(L, R);
    return ans;
  }
  void modulo(int L, int R, int x) {
    if (mx < x) return;
    if (l == r) {
      sum %= x;
      mx %= x;
      return;
    }
    int m = (l + r) >> 1;
    if (L <= m) pl->modulo(L, R, x);
    if (R > m) pr->modulo(L, R, x);
    update();
  }
  void set(int k, int x) {
    if (l == r) {
      sum = x;
      mx = x;
      return;
    }
    int m = (l + r) >> 1;
    if (k <= m)
      pl->set(k, x);
    else
      pr->set(k, x);
    update();
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  while (cin >> n >> m) {
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    Tree* lx = new Tree(1, n);
    int ty, l, r, k, x;
    for (int i = 0; i < m; i++) {
      cin >> ty;
      if (ty == 1) {
        cin >> l >> r;
        cout << lx->query(l, r) << endl;
      } else if (ty == 2) {
        cin >> l >> r >> x;
        lx->modulo(l, r, x);
      } else {
        cin >> k >> x;
        lx->set(k, x);
      }
    }
  }
  return 0;
}