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 int base[100010], st[4 * 100010], sm[4 * 100010];
void build(int v, int s, int e) {
  if (s == e) {
    st[v] = base[s];
    sm[v] = base[s];
    return;
  }
  int mid = (s + e) / 2;
  build(2 * v, s, mid);
  build(2 * v + 1, mid + 1, e);
  st[v] = max(st[2 * v], st[2 * v + 1]);
  sm[v] = sm[2 * v] + sm[2 * v + 1];
}
void update(int v, int s, int e, int l, int r, long long int val) {
  if (s > e || l > e || r < s) return;
  if (s == e) {
    st[v] = val;
    sm[v] = val;
    return;
  }
  int mid = (s + e) / 2;
  update(2 * v, s, mid, l, r, val);
  update(2 * v + 1, mid + 1, e, l, r, val);
  st[v] = max(st[2 * v], st[2 * v + 1]);
  sm[v] = sm[2 * v] + sm[2 * v + 1];
}
void mod(int v, int s, int e, int l, int r, long long int x) {
  if (s > e || l > e || r < s) return;
  if (x > st[v]) return;
  if (s == e) {
    st[v] %= x;
    sm[v] %= x;
    return;
  }
  int mid = (s + e) / 2;
  mod(2 * v, s, mid, l, r, x);
  mod(2 * v + 1, mid + 1, e, l, r, x);
  st[v] = max(st[2 * v], st[2 * v + 1]);
  sm[v] = sm[2 * v] + sm[2 * v + 1];
}
long long int query(int v, int s, int e, int l, int r) {
  if (s > e || l > e || r < s) return 0;
  if (l <= s && r >= e) return sm[v];
  int mid = (s + e) / 2;
  long long int q1 = query(2 * v, s, mid, l, r);
  long long int q2 = query(2 * v + 1, mid + 1, e, l, r);
  return q1 + q2;
}
void fun() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> base[i];
  build(1, 1, n);
  while (m--) {
    int type, l, r;
    cin >> type;
    if (type == 1) {
      cin >> l >> r;
      long long int q = query(1, 1, n, l, r);
      cout << q << endl;
    } else if (type == 2) {
      long long int x;
      cin >> l >> r >> x;
      mod(1, 1, n, l, r, x);
    } else {
      long long int x;
      cin >> l >> x;
      update(1, 1, n, l, l, x);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) fun();
}