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 = 1e5 + 7;
struct node {
  int xam, idx;
  long long sum;
  node() { sum = 0, xam = idx = -1; }
} seg[4 * MAXN];
int n;
int a[MAXN];
void merge(int x) {
  seg[x].sum = seg[x << 1].sum + seg[x << 1 | 1].sum;
  if (seg[x << 1].xam > seg[x << 1 | 1].xam)
    seg[x].xam = seg[x << 1].xam, seg[x].idx = seg[x << 1].idx;
  else
    seg[x].xam = seg[x << 1 | 1].xam, seg[x].idx = seg[x << 1 | 1].idx;
}
void modify(int idx, int val, int x = 1, int xl = 0, int xr = n) {
  if (xr - xl == 1) {
    seg[x].sum = seg[x].xam = val;
    seg[x].idx = xl;
    return;
  }
  int xm = (xl + xr) >> 1;
  if (idx < xm)
    modify(idx, val, x << 1, xl, xm);
  else
    modify(idx, val, x << 1 | 1, xm, xr);
  merge(x);
}
long long getsum(int ql, int qr, int x = 1, int xl = 0, int xr = n) {
  if (qr <= xl || ql >= xr) return 0;
  if (ql <= xl && qr >= xr) return seg[x].sum;
  int xm = (xl + xr) >> 1;
  long long res = 0;
  res += getsum(ql, qr, x << 1, xl, xm);
  res += getsum(ql, qr, x << 1 | 1, xm, xr);
  return res;
}
pair<int, int> getmax(int ql, int qr, int x = 1, int xl = 0, int xr = n) {
  if (qr <= xl || ql >= xr) return {-1, -1};
  if (ql <= xl && qr >= xr) return {seg[x].xam, seg[x].idx};
  int xm = (xl + xr) >> 1;
  pair<int, int> res = {-1, -1};
  res = max(res, getmax(ql, qr, x << 1, xl, xm));
  res = max(res, getmax(ql, qr, x << 1 | 1, xm, xr));
  return res;
}
int main() {
  int m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    modify(i, a[i]);
  }
  while (m--) {
    int type;
    cin >> type;
    if (type == 1) {
      int l, r;
      cin >> l >> r;
      cout << getsum(--l, r) << "\n";
    } else if (type == 2) {
      int l, r, x;
      cin >> l >> r >> x;
      l--;
      do {
        pair<int, int> ret = getmax(l, r);
        if (ret.first < x) break;
        modify(ret.second, ret.first % x);
      } while (true);
    } else {
      int k, x;
      cin >> k >> x;
      modify(--k, x);
    }
  }
  return 0;
}