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>
const double PI = 3.1415926535897932384626433;
const int KL = 1e5 + 10;
const long long MOD = 1e9 + 7;
using namespace std;
long long n, m, a[KL], sum[4 * KL], mx[4 * KL], y, z, type;
void pushup(int cur) {
  sum[cur] = sum[2 * cur] + sum[2 * cur + 1];
  mx[cur] = max(mx[2 * cur], mx[2 * cur + 1]);
}
void build(int cur = 1, int st = 1, int en = n) {
  if (st == en)
    sum[cur] = a[st], mx[cur] = a[st];
  else {
    int mid = (st + en) / 2;
    build(2 * cur, st, mid);
    build(2 * cur + 1, mid + 1, en);
    pushup(cur);
  }
}
void _set(int pos, long long val, int cur = 1, int st = 1, int en = n) {
  if (st == en)
    sum[cur] = val, mx[cur] = val;
  else {
    int mid = (st + en) / 2;
    if (pos <= mid)
      _set(pos, val, 2 * cur, st, mid);
    else
      _set(pos, val, 2 * cur + 1, mid + 1, en);
    pushup(cur);
  }
}
void update(int l, int r, long long x, int cur = 1, int st = 1, int en = n) {
  if (l > en || st > r || mx[cur] < x) return;
  if (st == en)
    sum[cur] %= x, mx[cur] %= x;
  else {
    int mid = (st + en) / 2;
    update(l, r, x, 2 * cur, st, mid);
    update(l, r, x, 2 * cur + 1, mid + 1, en);
    pushup(cur);
  }
}
long long query(int l, int r, int cur = 1, int st = 1, int en = n) {
  if (l > en || r < st) return 0;
  if (l <= st && en <= r) return sum[cur];
  int mid = (st + en) / 2;
  return query(l, r, 2 * cur, st, mid) + query(l, r, 2 * cur + 1, mid + 1, en);
}
int main() {
  scanf("%lld", &n);
  scanf("%lld", &m);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  build();
  while (m--) {
    scanf("%lld", &type);
    if (type == 1) {
      scanf("%lld", &y);
      scanf("%lld", &z);
      printf("%lld\n", query(y, z));
    } else if (type == 2) {
      long long mod;
      scanf("%lld", &y);
      scanf("%lld", &z);
      scanf("%lld", &mod);
      update(y, z, mod);
    } else {
      scanf("%lld", &y);
      scanf("%lld", &z);
      _set(y, z);
    }
  }
  return 0;
}