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 comp {
  bool operator()(int a, int b) { return a > b; }
};
int data[100005];
long long treeSum[4 * 100005];
int treeMax[4 * 100005];
void buildTree(int idx, int l, int r) {
  if (l == r) {
    treeMax[idx] = data[l];
    treeSum[idx] = treeMax[idx];
  } else {
    int m = (l + r) / 2;
    buildTree(idx * 2, l, m);
    buildTree(idx * 2 + 1, m + 1, r);
    treeSum[idx] = treeSum[idx * 2] + treeSum[idx * 2 + 1];
    treeMax[idx] = max(treeMax[idx * 2], treeMax[idx * 2 + 1]);
  }
}
void updateTree(int idx, int l, int r, int idxToUpdate, int valueToUpdate) {
  if (l == r) {
    treeMax[idx] = valueToUpdate;
    treeSum[idx] = treeMax[idx];
  } else {
    int m = (l + r) / 2;
    if (idxToUpdate <= m)
      updateTree(idx * 2, l, m, idxToUpdate, valueToUpdate);
    else
      updateTree(idx * 2 + 1, m + 1, r, idxToUpdate, valueToUpdate);
    treeSum[idx] = treeSum[idx * 2] + treeSum[idx * 2 + 1];
    treeMax[idx] = max(treeMax[idx * 2], treeMax[idx * 2 + 1]);
  }
}
void updateTreeModule(int idx, int l, int r, int ql, int qr, int mod) {
  if (l == r) {
    treeMax[idx] = treeMax[idx] % mod;
    treeSum[idx] = treeMax[idx];
  } else {
    if (ql <= l && r <= qr && treeMax[idx] < mod)
      return;
    else {
      int m = (l + r) / 2;
      if (ql <= m) updateTreeModule(idx * 2, l, m, ql, qr, mod);
      if (m < qr) updateTreeModule(idx * 2 + 1, m + 1, r, ql, qr, mod);
      treeSum[idx] = treeSum[idx * 2] + treeSum[idx * 2 + 1];
      treeMax[idx] = max(treeMax[idx * 2], treeMax[idx * 2 + 1]);
    }
  }
}
long long queryTree(int idx, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr)
    return treeSum[idx];
  else {
    int m = (l + r) / 2;
    if (qr <= m)
      return queryTree(idx * 2, l, m, ql, qr);
    else if (m < ql)
      return queryTree(idx * 2 + 1, m + 1, r, ql, qr);
    else
      return queryTree(idx * 2, l, m, ql, qr) +
             queryTree(idx * 2 + 1, m + 1, r, ql, qr);
  }
}
int main() {
  int n, m, t, l, r, k, x;
  scanf("%d %d", &n, &m);
  for (int i = ((int)1); i <= ((int)n); i++) scanf("%d", &data[i]);
  buildTree(1, 1, n);
  for (int i = ((int)1); i <= ((int)m); i++) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d %d", &l, &r);
      cout << queryTree(1, 1, n, l, r) << endl;
    } else if (t == 2) {
      scanf("%d %d %d", &l, &r, &x);
      updateTreeModule(1, 1, n, l, r, x);
    } else {
      scanf("%d %d", &k, &x);
      updateTree(1, 1, n, k, x);
    }
  }
  return 0;
}