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 MAX_N = 100005;
long long sum[MAX_N], tree[MAX_N << 2], lazy[MAX_N << 2], a[MAX_N],
    tmax[MAX_N << 2];
inline void push_up(int p) {
  tree[p] = tree[p << 1] + tree[p << 1 | 1];
  tmax[p] = max(tmax[p << 1], tmax[p << 1 | 1]);
}
void build(int l, int r, int p) {
  if (l == r) {
    int num;
    cin >> num;
    tree[p] = num;
    tmax[p] = num;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, p << 1), build(mid + 1, r, p << 1 | 1);
  push_up(p);
}
long long query(int l, int r, int p, int L, int R) {
  if (L <= l && r <= R) return tree[p];
  int mid = (l + r) >> 1;
  long long ret = 0;
  if (L <= mid) ret += query(l, mid, p << 1, L, R);
  if (R > mid) ret += query(mid + 1, r, p << 1 | 1, L, R);
  return ret;
}
void update(int l, int r, int p, int L, int R, int s) {
  if (tmax[p] < s) return;
  if (L <= l && r <= R && l == r) {
    tree[p] %= s;
    tmax[p] %= s;
    return;
  }
  int mid = (l + r) >> 1;
  if (L <= mid) update(l, mid, p << 1, L, R, s);
  if (R > mid) update(mid + 1, r, p << 1 | 1, L, R, s);
  push_up(p);
}
void update(int i, int p, int l, int r, int s) {
  if (l == r) {
    tree[p] = s;
    tmax[p] = s;
    return;
  }
  int mid = (l + r) >> 1;
  if (i <= mid)
    update(i, p << 1, l, mid, s);
  else
    update(i, p << 1 | 1, mid + 1, r, s);
  push_up(p);
}
int main() {
  int n, m, x, y, z, ch;
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  build(1, n, 1);
  while (m--) {
    cin >> ch >> x >> y;
    if (ch == 1)
      cout << query(1, n, 1, x, y) << endl;
    else if (ch == 2) {
      cin >> z;
      update(1, n, 1, x, y, z);
    } else
      update(x, 1, 1, n, y);
  }
  return 0;
}