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 long long MAXN = 100100;
long long n, m, a[MAXN], cnt;
struct node {
  long long left, right, s, Max;
  node *ch[2];
} pool[MAXN * 3], *root;
inline void pushup(node *r) {
  r->s = r->ch[0]->s + r->ch[1]->s;
  r->Max = max(r->ch[0]->Max, r->ch[1]->Max);
}
inline void build(node *r, long long left, long long right) {
  r->left = left, r->right = right;
  if (left == right) {
    r->s = r->Max = a[left];
    return;
  }
  node *lson = &pool[++cnt], *rson = &pool[++cnt];
  long long mid = (left + right) / 2;
  r->ch[0] = lson, r->ch[1] = rson;
  build(lson, left, mid), build(rson, mid + 1, right);
  pushup(r);
}
inline void update(node *r, long long pos, long long x) {
  if (r->left == pos && r->left == r->right) {
    r->Max = r->s = x;
    return;
  }
  long long mid = (r->left + r->right) / 2;
  if (pos <= mid)
    update(r->ch[0], pos, x);
  else
    update(r->ch[1], pos, x);
  pushup(r);
}
inline void Mod(node *r, long long left, long long right, long long p) {
  if (r->Max < p) return;
  if (r->left == r->right) {
    r->s %= p;
    r->Max %= p;
    return;
  }
  if (r->ch[0]->right >= right)
    Mod(r->ch[0], left, right, p);
  else if (r->ch[1]->left <= left)
    Mod(r->ch[1], left, right, p);
  else
    Mod(r->ch[0], left, r->ch[0]->right, p),
        Mod(r->ch[1], r->ch[1]->left, right, p);
  pushup(r);
}
inline long long query(node *r, long long left, long long right) {
  if (r->left == left && r->right == right) return r->s;
  if (r->ch[0]->right >= right)
    return query(r->ch[0], left, right);
  else if (r->ch[1]->left <= left)
    return query(r->ch[1], left, right);
  else
    return query(r->ch[0], left, r->ch[0]->right) +
           query(r->ch[1], r->ch[1]->left, right);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  build(root = &pool[0], 1, n);
  for (int i = 1; i <= m; i++) {
    int opt, l, r, p;
    scanf("%d%d%d", &opt, &l, &r);
    if (opt == 1) printf("%lld\n", query(root, l, r));
    if (opt == 2) {
      scanf("%lld", &p);
      Mod(root, l, r, p);
    }
    if (opt == 3) update(root, l, r);
  }
  return 0;
}