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 std::cin;
using std::cout;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::vector;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f;
const double eps = 1e-6;
int a[N];
struct tree {
  int l, r;
  long long max, sum;
} tr[N << 3];
void pushup(int ls, int rs, int rt) {
  tr[rt].sum = tr[ls].sum + tr[rs].sum;
  tr[rt].max = std::max(tr[ls].max, tr[rs].max);
}
void build(int l, int r, int rt) {
  tr[rt].l = l, tr[rt].r = r;
  if (l == r) {
    tr[rt].max = a[l];
    tr[rt].sum = a[l];
  } else {
    int mid = l + r >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    pushup(rt << 1, rt << 1 | 1, rt);
  }
}
void modify1(int l, int r, int rt, int ql, int qr, int x) {
  if (ql <= l && r <= qr && x > tr[rt].max) return;
  if (ql > r || l > qr) return;
  if (l == r) {
    tr[rt].max = tr[rt].max % x;
    tr[rt].sum = tr[rt].sum % x;
  } else {
    int mid = l + r >> 1;
    if (ql <= mid) modify1(l, mid, rt << 1, ql, qr, x);
    if (qr > mid) modify1(mid + 1, r, rt << 1 | 1, ql, qr, x);
    pushup(rt << 1, rt << 1 | 1, rt);
  }
}
void modify2(int l, int r, int rt, int pos, int val) {
  if (l == r) {
    tr[rt].max = val;
    tr[rt].sum = val;
  } else {
    int mid = l + r >> 1;
    if (pos <= mid)
      modify2(l, mid, rt << 1, pos, val);
    else
      modify2(mid + 1, r, rt << 1 | 1, pos, val);
    pushup(rt << 1, rt << 1 | 1, rt);
  }
}
long long query(int l, int r, int rt, int ql, int qr) {
  if (ql <= l && r <= qr) {
    return tr[rt].sum;
  } else {
    int mid = l + r >> 1;
    long long res = 0;
    if (ql <= mid) res += query(l, mid, rt << 1, ql, qr);
    if (qr > mid) res += query(mid + 1, r, rt << 1 | 1, ql, qr);
    return res;
  }
}
int main() {
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  build(1, n, 1);
  while (q--) {
    int ty, l, r, x;
    cin >> ty;
    if (ty == 1) {
      cin >> l >> r;
      cout << query(1, n, 1, l, r) << '\n';
    } else if (ty == 2) {
      cin >> l >> r >> x;
      modify1(1, n, 1, l, r, x);
    } else {
      cin >> l >> x;
      modify2(1, n, 1, l, x);
    }
  }
  return 0;
}