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;
long long sum[100005 << 2], maxx[100005 << 2];
long long a[100005];
void pushup(int o) {
  sum[o] = sum[o << 1] + sum[o << 1 | 1];
  maxx[o] = max(maxx[o << 1], maxx[o << 1 | 1]);
}
void build(int o, int l, int r) {
  if (l == r) {
    sum[o] = a[l];
    maxx[o] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(o << 1, l, mid);
  build(o << 1 | 1, mid + 1, r);
  pushup(o);
}
void change1(int o, int l, int r, int ql, int qr, int v) {
  if (maxx[o] < v) return;
  if (l == r) {
    sum[o] %= v;
    maxx[o] = sum[o];
    return;
  }
  int mid = (l + r) >> 1;
  if (mid >= ql) change1(o << 1, l, mid, ql, qr, v);
  if (mid < qr) change1(o << 1 | 1, mid + 1, r, ql, qr, v);
  pushup(o);
}
void change2(int o, int l, int r, int t, int v) {
  if (l == r) {
    sum[o] = v;
    maxx[o] = v;
    return;
  }
  int mid = (l + r) >> 1;
  if (mid >= t)
    change2(o << 1, l, mid, t, v);
  else
    change2(o << 1 | 1, mid + 1, r, t, v);
  pushup(o);
}
long long querysum(int o, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) return sum[o];
  long long ans = 0;
  int mid = (l + r) >> 1;
  if (mid >= ql) ans += querysum(o << 1, l, mid, ql, qr);
  if (mid < qr) ans += querysum(o << 1 | 1, mid + 1, r, ql, qr);
  return ans;
}
int main() {
  register int i;
  int n, m;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  build(1, 1, n);
  for (i = 1; i <= m; i++) {
    int t, l, r, v;
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d%d", &l, &r);
      printf("%lld\n", querysum(1, 1, n, l, r));
    }
    if (t == 2) {
      scanf("%d%d%d", &l, &r, &v);
      change1(1, 1, n, l, r, v);
    }
    if (t == 3) {
      scanf("%d%d", &l, &v);
      change2(1, 1, n, l, v);
    }
  }
  return 0;
}