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 N = 5e5;
int n, m;
struct node {
  int Max;
  long long val;
} t[N];
void read(int &x) {
  x = 0;
  char s = getchar();
  while (!isdigit(s)) s = getchar();
  while (isdigit(s)) x = (x << 1) + (x << 3) + s - '0', s = getchar();
}
void pushup(int x) {
  t[x].Max = max(t[x << 1].Max, t[x << 1 | 1].Max);
  t[x].val = t[x << 1].val + t[x << 1 | 1].val;
}
void build(int i, int l, int r) {
  if (l == r) {
    read(t[i].Max);
    t[i].val = t[i].Max;
    return;
  }
  int mid = (l + r) >> 1;
  build(i << 1, l, mid);
  build(i << 1 | 1, mid + 1, r);
  pushup(i);
}
long long query(int i, int l, int r, int x, int y) {
  if (l >= x && r <= y) return t[i].val;
  int mid = (l + r) >> 1;
  long long ans = 0;
  if (mid >= x) ans += query(i << 1, l, mid, x, y);
  if (mid < y) ans += query(i << 1 | 1, mid + 1, r, x, y);
  return ans;
}
void update1(int i, int l, int r, int x, int y, int mo) {
  if (t[i].Max < mo) return;
  if (l == r) {
    t[i].Max %= mo;
    t[i].val %= mo;
    return;
  }
  int mid = (l + r) >> 1;
  if (mid >= x) update1(i << 1, l, mid, x, y, mo);
  if (mid < y) update1(i << 1 | 1, mid + 1, r, x, y, mo);
  pushup(i);
}
void update2(int i, int l, int r, int k, int x) {
  if (l == r) {
    t[i].Max = t[i].val = x;
    return;
  }
  int mid = (l + r) >> 1;
  if (mid >= k)
    update2(i << 1, l, mid, k, x);
  else
    update2(i << 1 | 1, mid + 1, r, k, x);
  pushup(i);
}
int main() {
  read(n);
  read(m);
  build(1, 1, n);
  while (m--) {
    int opt, l, r, x, k;
    read(opt);
    if (opt == 1) {
      read(l);
      read(r);
      printf("%lld\n", query(1, 1, n, l, r));
    } else if (opt == 2) {
      read(l);
      read(r);
      read(x);
      update1(1, 1, n, l, r, x);
    } else {
      read(k);
      read(x);
      update2(1, 1, n, k, x);
    }
  }
}