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 double eps = 1e-8;
const double INF = 1e20;
const double PI = acos(-1.);
const int MXN = 100005;
const long long MOD = 1000000007;
struct SEG {
  int l, r;
  long long m;
  long long x;
  SEG() {}
  SEG(int _l, int _r) { l = _l, r = _r; }
} SGT[MXN << 2];
int a[100005];
void create(SEG &T, int t) {
  T.m = a[t];
  T.x = a[t];
}
void fresh(SEG &T, SEG &L, SEG &R) {
  T.x = max(L.x, R.x);
  T.m = L.m + R.m;
}
void build(int id, int l, int r) {
  SGT[id] = SEG(l, r);
  int mid = (l + r) / 2;
  if (l != r) {
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
    fresh(SGT[id], SGT[id << 1], SGT[id << 1 | 1]);
  } else
    create(SGT[id], l);
}
void modulo(int id, int l, int r, int w) {
  SEG &T = SGT[id];
  int mid = (T.l + T.r) / 2;
  if (T.l == l && T.r == r) {
    if (l == r) {
      T.m %= w;
      T.x %= w;
      return;
    } else {
      if (SGT[id << 1].x >= w) modulo(id << 1, l, mid, w);
      if (SGT[id << 1 | 1].x >= w) modulo(id << 1 | 1, mid + 1, r, w);
    }
  } else if (r <= mid)
    modulo(id << 1, l, r, w);
  else if (l > mid)
    modulo(id << 1 | 1, l, r, w);
  else {
    modulo(id << 1, l, mid, w);
    modulo(id << 1 | 1, mid + 1, r, w);
  }
  fresh(T, SGT[id << 1], SGT[id << 1 | 1]);
}
long long query(int id, int l, int r) {
  SEG &T = SGT[id];
  int mid = (T.l + T.r) / 2;
  if (l == T.l && r == T.r) return T.m;
  if (r <= mid)
    return query(id << 1, l, r);
  else if (l > mid)
    return query(id << 1 | 1, l, r);
  else
    return query(id << 1, l, mid) + query(id << 1 | 1, mid + 1, r);
}
void update(int id, int k, int x) {
  SEG &T = SGT[id];
  int mid = (T.l + T.r) / 2;
  if (T.l == T.r) {
    T.m = T.x = x;
    return;
  }
  if (k > mid)
    update(id << 1 | 1, k, x);
  else
    update(id << 1, k, x);
  fresh(T, SGT[id << 1], SGT[id << 1 | 1]);
}
int main() {
  int i, j, l, r, x;
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    for (i = 1; i <= n; i++) scanf("%d", &a[i]);
    build(1, 1, n);
    while (m--) {
      int Q;
      scanf("%d", &Q);
      if (Q == 1) {
        scanf("%d%d", &l, &r);
        printf("%I64d\n", query(1, l, r));
      } else if (Q == 2) {
        scanf("%d%d%d", &l, &r, &x);
        modulo(1, l, r, x);
      } else if (Q == 3) {
        scanf("%d%d", &l, &x);
        update(1, l, x);
      }
    }
  }
  return 0;
}