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;
int primero = 1 << 17;
const int tope = 1 << 18;
long long int suma[tope];
long long int maximo[tope];
void inserta(int pos, long long int val) {
  pos += primero;
  suma[pos] = maximo[pos] = val;
  while (pos > 1) {
    pos /= 2;
    suma[pos] = suma[2 * pos] + suma[2 * pos + 1];
    maximo[pos] = max(maximo[2 * pos], maximo[2 * pos + 1]);
  }
}
long long int sumaentre(int inf, int sup) {
  if (inf > sup) return 0;
  inf += primero;
  sup += primero;
  if (inf == sup) return suma[inf];
  long long int s = suma[inf] + suma[sup];
  while (inf + 1 < sup) {
    if (inf % 2 == 0) s += suma[inf + 1];
    inf /= 2;
    if (sup % 2 == 1) s += suma[sup - 1];
    sup /= 2;
  }
  return s;
}
void modular(int pos, long long int x) {
  if (pos > primero) {
    suma[pos] %= x;
    maximo[pos] = suma[pos];
    return;
  }
  if (maximo[2 * pos] >= x) modular(2 * pos, x);
  if (maximo[2 * pos + 1] >= x) modular(2 * pos + 1, x);
  suma[pos] = suma[2 * pos] + suma[2 * pos + 1];
  maximo[pos] = max(maximo[2 * pos], maximo[2 * pos + 1]);
}
void modular(int inf, int sup, long long int x) {
  int infini = inf;
  int supini = sup;
  if (inf > sup) return;
  if (inf == sup) {
    inserta(inf, suma[inf + primero] % x);
    return;
  }
  inf += primero;
  sup += primero;
  while (inf + 1 < sup) {
    if (inf % 2 == 0) modular(inf + 1, x);
    inf /= 2;
    if (sup % 2 == 1) modular(sup - 1, x);
    sup /= 2;
  }
  inserta(infini, suma[infini + primero] % x);
  inserta(supini, suma[supini + primero] % x);
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    long long int a;
    cin >> a;
    inserta(i, a);
  }
  for (int i = 0; i < m; i++) {
    int t;
    cin >> t;
    if (t == 1) {
      int l, r;
      cin >> l >> r;
      cout << sumaentre(l, r) << endl;
    } else if (t == 2) {
      int l, r;
      long long int x;
      cin >> l >> r >> x;
      modular(l, r, x);
    } else {
      int k;
      long long int x;
      cin >> k >> x;
      inserta(k, x);
    }
  }
}