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 maxn = 1e5 + 5;
int n;
long long a[maxn];
class SegmentTree {
 private:
  long long wife[maxn << 2], sum[maxn << 2];
  inline void pushup(int u) {
    wife[u] = max(wife[u << 1], wife[u << 1 | 1]);
    sum[u] = sum[u << 1] + sum[u << 1 | 1];
  }

 public:
  void build(int u, int l, int r) {
    if (l == r) return sum[u] = wife[u] = a[l], void();
    int mid = (l + r) >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
    pushup(u);
  }
  void modifymod(int u, int l, int r, int x, int y, long long val) {
    if (wife[u] < val) return;
    if (l == r) return wife[u] %= val, sum[u] %= val, void();
    int mid = (l + r) >> 1;
    if (x <= mid) modifymod(u << 1, l, mid, x, y, val);
    if (y > mid) modifymod(u << 1 | 1, mid + 1, r, x, y, val);
    pushup(u);
  }
  void modifyval(int u, int l, int r, int x, long long val) {
    if (l == r) return wife[u] = sum[u] = val, void();
    int mid = (l + r) >> 1;
    if (x <= mid)
      modifyval(u << 1, l, mid, x, val);
    else
      modifyval(u << 1 | 1, mid + 1, r, x, val);
    pushup(u);
  }
  long long query(int u, int l, int r, int x, int y) {
    if (x <= l && r <= y) return sum[u];
    int mid = (l + r) >> 1;
    long long res = 0;
    if (x <= mid) res += query(u << 1, l, mid, x, y);
    if (y > mid) res += query(u << 1 | 1, mid + 1, r, x, y);
    return res;
  }
} wife;
inline int read() {
  char c;
  while (!isdigit(c = getchar()))
    ;
  int x = c ^ 48;
  while (isdigit(c = getchar())) x = x * 10 + (c ^ 48);
  return x;
}
int main() {
  int q, opt, l, r;
  n = read();
  q = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  wife.build(1, 1, n);
  while (q--) {
    opt = read();
    l = read();
    r = read();
    if (opt == 1)
      printf("%lld\n", wife.query(1, 1, n, l, r));
    else if (opt == 2)
      wife.modifymod(1, 1, n, l, r, read());
    else
      wife.modifyval(1, 1, n, l, r);
  }
  return 0;
}