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 n, Q, a[100005];
struct tree {
  int left, right, maxx;
  long long sum;
} t[4 * 100005];
void update(int id) {
  t[id].sum = t[2 * id].sum + t[2 * id + 1].sum;
  t[id].maxx = max(t[2 * id].maxx, t[2 * id + 1].maxx);
}
void build(int id, int left, int right) {
  t[id].left = left;
  t[id].right = right;
  if (left == right) {
    t[id].sum = t[id].maxx = a[left];
    return;
  }
  int mid = (left + right) / 2;
  build(2 * id, left, mid);
  build(2 * id + 1, mid + 1, right);
  update(id);
}
void Mod(int id, int left, int right, int k) {
  if (t[id].left == left && t[id].right == right && t[id].maxx < k) return;
  if (t[id].left == t[id].right) {
    t[id].sum %= k;
    t[id].maxx %= k;
    return;
  }
  if (t[2 * id].right >= right)
    Mod(2 * id, left, right, k);
  else if (t[2 * id + 1].left <= left)
    Mod(2 * id + 1, left, right, k);
  else {
    Mod(2 * id, left, t[2 * id].right, k);
    Mod(2 * id + 1, t[2 * id + 1].left, right, k);
  }
  update(id);
}
void change(int id, int x, int k) {
  if (t[id].left == t[id].right) {
    t[id].sum = t[id].maxx = k;
    return;
  }
  if (t[2 * id].right >= x)
    change(2 * id, x, k);
  else
    change(2 * id + 1, x, k);
  update(id);
}
long long query(int id, int left, int right) {
  if (t[id].left == left && t[id].right == right) return t[id].sum;
  if (t[2 * id].right >= right)
    return query(2 * id, left, right);
  else if (t[2 * id + 1].left <= left)
    return query(2 * id + 1, left, right);
  else
    return query(2 * id, left, t[2 * id].right) +
           query(2 * id + 1, t[2 * id + 1].left, right);
}
int main() {
  scanf("%d%d", &n, &Q);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  build(1, 1, n);
  int o, xi, yi, zi;
  while (Q--) {
    scanf("%d%d%d", &o, &xi, &yi);
    if (o == 1)
      printf("%lld\n", query(1, xi, yi));
    else if (o == 2) {
      scanf("%d", &zi);
      Mod(1, xi, yi, zi);
    } else
      change(1, xi, yi);
  }
  return 0;
}