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 long long INF = 1000000000 + 7;
const double esp = 1e-13;
const double pi = 3.141592653589;
const int MAX = 500000;
long long ans, a[MAX + 10], f[MAX + 10], n, m, d, l, r, x, ql, qx;
void build(int k, int l, int r) {
  if (l == r) {
    cin >> a[k];
    f[k] = a[k];
    return;
  }
  int m = (l + r) / 2;
  build(k * 2, l, m);
  build(k * 2 + 1, m + 1, r);
  f[k] = f[k * 2] + f[k * 2 + 1];
  a[k] = max(a[k * 2], a[k * 2 + 1]);
}
void tinh(int k, int l, int r, int i, int j) {
  if (i > r || l > j) return;
  if (i <= l && r <= j) {
    ans += f[k];
    return;
  }
  int m = (l + r) / 2;
  tinh(k * 2, l, m, i, j);
  tinh(k * 2 + 1, m + 1, r, i, j);
}
void update(int k, int l, int r, int i, int j) {
  if (l == r) {
    a[k] %= x;
    f[k] = a[k];
    return;
  }
  if (a[k] < x) return;
  int m = (l + r) / 2;
  if (i <= m) update(k * 2, l, m, i, j);
  if (m < j) update(k * 2 + 1, m + 1, r, i, j);
  f[k] = f[k * 2] + f[k * 2 + 1];
  a[k] = max(a[k * 2], a[k * 2 + 1]);
}
void change(int k, int l, int r) {
  if (l == r) {
    f[k] = a[k] = qx;
    return;
  }
  int m = (l + r) / 2;
  if (ql <= m)
    change(k * 2, l, m);
  else
    change(k * 2 + 1, m + 1, r);
  f[k] = f[k * 2] + f[k * 2 + 1];
  a[k] = max(a[k * 2], a[k * 2 + 1]);
}
int main() {
  ios ::sync_with_stdio(false);
  cin >> n >> m;
  build(1, 1, n);
  while (m--) {
    cin >> d;
    if (d == 1) {
      cin >> l >> r;
      ans = 0;
      tinh(1, 1, n, l, r);
      cout << ans << "\n";
    } else if (d == 2) {
      cin >> l >> r >> x;
      update(1, 1, n, l, r);
    } else {
      cin >> ql >> qx;
      change(1, 1, n);
    }
  }
}