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 a[100001];
long long tree[400004];
long long mx[400004];
void build(int node, int s, int e) {
  if (s == e) {
    tree[node] = a[s];
    mx[node] = a[s];
    return;
  }
  int m = (s + e) >> 1;
  build(node * 2, s, m);
  build((node * 2) + 1, m + 1, e);
  tree[node] = tree[(node * 2)] + tree[(node * 2) + 1];
  mx[node] = max(mx[(node * 2)], mx[(node * 2) + 1]);
}
void mod(int node, int s, int e, int l, int r, long long val) {
  if (r < s || l > e) return;
  if (mx[node] < val) return;
  if (s == e) {
    mx[node] %= val;
    tree[node] %= val;
    return;
  }
  int m = (s + e) >> 1;
  mod(node * 2, s, m, l, r, val);
  mod((node * 2) + 1, m + 1, e, l, r, val);
  mx[node] = max(mx[(node * 2)], mx[(node * 2) + 1]);
  tree[node] = tree[(node * 2)] + tree[(node * 2) + 1];
}
void upd(int node, int s, int e, int p, long long val) {
  if (s == e) {
    mx[node] = val;
    tree[node] = val;
    return;
  }
  int m = (s + e) >> 1;
  if (p <= m)
    upd(node * 2, s, m, p, val);
  else
    upd((node * 2) + 1, m + 1, e, p, val);
  mx[node] = max(mx[node * 2], mx[(node * 2) + 1]);
  tree[node] = tree[node * 2] + tree[(node * 2) + 1];
}
long long getsum(int node, int s, int e, int l, int r) {
  if (l > e || r < s) return 0;
  if (l <= s && r >= e)
    return tree[node];
  else {
    int m = (s + e) >> 1;
    long long y = getsum(node * 2, s, m, l, r);
    long long y1 = getsum((node * 2) + 1, m + 1, e, l, r);
    return (y1 + y);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, c, z;
  long long b, v;
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i];
  build(1, 0, n - 1);
  for (int i = 0; i < m; i++) {
    cin >> z;
    if (z == 2) {
      cin >> c >> v >> b;
      mod(1, 0, n - 1, c - 1, v - 1, b);
    } else if (z == 1) {
      cin >> c >> v;
      cout << getsum(1, 0, n - 1, c - 1, v - 1) << "\n";
    } else if (z == 3) {
      cin >> c >> v;
      upd(1, 0, n - 1, c - 1, v);
    }
  }
  return 0;
}