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 = 100005;
struct jz {
  int L, R, mi;
  long long x;
} a[maxn * 4];
int n, m, w[maxn];
inline int _read() {
  int num = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') num = num * 10 + ch - 48, ch = getchar();
  return num;
}
void up(int x) {
  a[x].mi = max(a[x * 2].mi, a[x * 2 + 1].mi);
  a[x].x = a[x * 2].x + a[x * 2 + 1].x;
}
void Build(int x, int L, int R) {
  a[x].L = L;
  a[x].R = R;
  if (L == R) {
    a[x].mi = w[L];
    a[x].x = w[L];
    return;
  }
  int mid = L + (R - L >> 1);
  Build(x * 2, L, mid);
  Build(x * 2 + 1, mid + 1, R);
  up(x);
}
void change(int x, int L, int R, int y) {
  if (a[x].mi < y) return;
  if (a[x].L == a[x].R) {
    a[x].mi %= y;
    a[x].x = a[x].mi;
    return;
  }
  int mid = a[x].L + (a[x].R - a[x].L >> 1);
  if (R <= mid)
    change(x * 2, L, R, y);
  else if (L > mid)
    change(x * 2 + 1, L, R, y);
  else
    change(x * 2, L, mid, y), change(x * 2 + 1, mid + 1, R, y);
  up(x);
}
void op(int x, int w, int y) {
  if (a[x].L == a[x].R) {
    a[x].mi = y;
    a[x].x = a[x].mi;
    return;
  }
  int mid = a[x].L + (a[x].R - a[x].L >> 1);
  if (w <= mid)
    op(x * 2, w, y);
  else
    op(x * 2 + 1, w, y);
  up(x);
}
long long ask(int x, int L, int R) {
  if (L == a[x].L && R == a[x].R) return a[x].x;
  int mid = a[x].L + (a[x].R - a[x].L >> 1);
  if (R <= mid)
    return ask(x * 2, L, R);
  else if (L > mid)
    return ask(x * 2 + 1, L, R);
  else
    return ask(x * 2, L, mid) + ask(x * 2 + 1, mid + 1, R);
}
int main() {
  n = _read();
  m = _read();
  for (int i = 1; i <= n; i++) w[i] = _read();
  Build(1, 1, n);
  while (m--) {
    int h = _read(), L = _read(), R = _read(), x;
    if (h == 1) printf("%lld\n", ask(1, L, R));
    if (h == 2) x = _read(), change(1, L, R, x);
    if (h == 3) op(1, L, R);
  }
}