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 info {
  long long s, m;
  info(int x = 0) : s(x), m(x) {}
} T[3 * 100000 + 5];
info operator+(const info& x, const info& y) {
  info f;
  f.s = x.s + y.s;
  f.m = max(x.m, y.m);
  return f;
}
int n, m, i, x, y, t;
void build(int i, int x, int y) {
  int t = (x + y) / 2;
  if (x == y) {
    scanf("%d", &x);
    T[i] = info(x);
    return;
  }
  build(i * 2, x, t);
  build(i * 2 + 1, t + 1, y);
  T[i] = T[i * 2] + T[i * 2 + 1];
}
long long sum(int i, int x, int y, int a, int b) {
  int t = (x + y) / 2;
  if (b < x || y < a) return 0;
  if (x >= a && b >= y) return T[i].s;
  return sum(i * 2, x, t, a, b) + sum(i * 2 + 1, t + 1, y, a, b);
}
void ch(int i, int x, int y, int a, int b) {
  int t = (x + y) / 2;
  if (x == y) {
    T[i] = info(b);
    return;
  }
  if (a <= t)
    ch(i * 2, x, t, a, b);
  else
    ch(i * 2 + 1, t + 1, y, a, b);
  T[i] = T[i * 2] + T[i * 2 + 1];
}
void mod(int i, int x, int y, int a, int b, int k) {
  int t = (x + y) / 2;
  if (T[i].m < k) return;
  if (b < x || a > y) return;
  if (x == y) {
    T[i].m = T[i].s = T[i].s % k;
    return;
  }
  mod(i * 2, x, t, a, b, k);
  mod(i * 2 + 1, t + 1, y, a, b, k);
  T[i] = T[i * 2] + T[i * 2 + 1];
}
int main() {
  scanf("%d%d", &n, &m);
  build(1, 1, n);
  for (i = 1; i <= m; i++) {
    scanf("%d", &x);
    if (x == 1) {
      scanf("%d%d", &x, &y);
      printf("%I64d\n", sum(1, 1, n, x, y));
    } else if (x == 2) {
      scanf("%d%d%d", &x, &y, &t);
      mod(1, 1, n, x, y, t);
    } else {
      scanf("%d%d", &x, &y);
      ch(1, 1, n, x, y);
    }
  }
  return 0;
}