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;
template <class T, class S>
inline bool minup(T& m, const S x) {
  return m > (T)x ? (m = (T)x, true) : false;
}
template <class T, class S>
inline bool maxup(T& m, const S x) {
  return m < (T)x ? (m = (T)x, true) : false;
}
static const int INF = 1000000000;
static const long long int MOD = 1000000007LL;
static const double EPS = 1E-10;
const int SZ = 1 << 20;
int _n, n, m;
long long int a;
int q, l, r, k;
long long int v;
long long int sega[4 * SZ + 1];
long long int segb[4 * SZ + 1];
void init() {
  _n = 1;
  while (_n < n) _n *= 2;
}
long long int print(int a, int b, int k = 0, int l = 0, int r = _n) {
  if (b <= l || r <= a) return 0LL;
  if (a <= l && r <= b) return sega[k];
  return print(a, b, 2 * k + 1, l, (l + r) / 2) +
         print(a, b, 2 * k + 2, (l + r) / 2, r);
}
void modulo(int a, int b, long long int v, int k = 0, int l = 0, int r = _n) {
  if (segb[k] < v) return;
  if (b <= l || r <= a) return;
  if (a <= l && r <= b && l + 1 == r) {
    sega[k] %= v;
    segb[k] = sega[k];
    return;
  }
  modulo(a, b, v, 2 * k + 1, l, (l + r) / 2);
  modulo(a, b, v, 2 * k + 2, (l + r) / 2, r);
  sega[k] = sega[2 * k + 1] + sega[2 * k + 2];
  segb[k] = max(segb[2 * k + 1], segb[2 * k + 2]);
}
void setter(long long int v, int k) {
  k += _n - 1;
  sega[k] = v;
  segb[k] = v;
  while (k > 0) {
    k = (k - 1) / 2;
    sega[k] = sega[2 * k + 1] + sega[2 * k + 2];
    segb[k] = max(segb[2 * k + 1], segb[2 * k + 2]);
  }
}
int main(int argc, char* argv[]) {
  scanf(" %d %d", &n, &m);
  init();
  for (int(i) = 0; (i) < (n); (i)++) {
    scanf(" %I64d", &a);
    setter(a, i);
  }
  if (1)
    while (m--) {
      scanf(" %d ", &q);
      if (q == 1) {
        scanf(" %d %d", &l, &r);
        printf("%I64d\n", print(l - 1, r));
      } else if (q == 2) {
        scanf(" %d %d %I64d", &l, &r, &v);
        modulo(l - 1, r, v);
      } else {
        scanf(" %d %I64d", &k, &v);
        setter(v, k - 1);
      }
    }
  return 0;
}