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;
#pragma comment(linker, "/STACK:255000000")
bool firstout = 1;
template <class T>
T &minn(T &a, T b) {
  if (b < a) a = b;
  return a;
}
template <class T>
T &maxx(T &a, T b) {
  if (a < b) a = b;
  return a;
}
int &madd(int &a, int b) {
  a += b;
  if (a >= 1000000007) a -= 1000000007;
  return a;
}
int &msub(int &a, int b) {
  a -= b;
  if (a < 0) a += 1000000007;
  return a;
}
int &mmult(int &a, int b) { return a = (long long)a * b % 1000000007; }
int mdiv(long long a, long long b, long long m) {
  a = (a % m + m) % m;
  b = (b % m + m) % m;
  if (a % b == 0) return a / b;
  return (a + m * mdiv(-a, m, b)) / b;
}
int n, m, q, nt;
int A[401234];
long long S[401234];
int L[401234], R[401234];
long long tsum(int i, int l, int r) {
  maxx(l, L[i]);
  minn(r, R[i]);
  if (r < l) return 0;
  if (l == L[i] && r == R[i]) return S[i];
  return tsum(i + i, l, r) + tsum(i + i + 1, l, r);
}
void tmod(int i, int l, int r, int m) {
  maxx(l, L[i]);
  minn(r, R[i]);
  if (r < l || A[i] < m) return;
  if (L[i] == R[i]) {
    S[i] = A[i] = A[i] % m;
    return;
  }
  tmod(i + i, l, r, m);
  tmod(i + i + 1, l, r, m);
  A[i] = max(A[i + i], A[i + i + 1]);
  S[i] = S[i + i] + S[i + i + 1];
}
void tset(int i, int j, int a) {
  if (j < L[i] || j > R[i]) return;
  if (j == L[i] && j == R[i]) {
    S[i] = A[i] = a;
    return;
  }
  tset(i + i, j, a);
  tset(i + i + 1, j, a);
  A[i] = max(A[i + i], A[i + i + 1]);
  S[i] = S[i + i] + S[i + i + 1];
}
int main() {
  int i, j, k;
  char c;
  int a, d;
  int ts;
  for (ts = 1; scanf("%"
                     "d",
                     &(n)) > 0;
       ++ts) {
    scanf(
        "%"
        "d",
        &(q));
    nt = n;
    for (; nt & nt - 1; ++nt)
      ;
    for (i = (nt); i < (nt + nt); ++i) A[i] = S[i] = 0, L[i] = R[i] = i - nt;
    for (i = (0); i < (n); ++i)
      scanf(
          "%"
          "d",
          &(A[nt + i])),
          S[nt + i] = A[nt + i];
    for (i = (nt)-1; i >= (1); --i)
      L[i] = L[i + i], R[i] = R[i + i + 1], S[i] = S[i + i] + S[i + i + 1],
      A[i] = max(A[i + i], A[i + i + 1]);
    for (; q--;) {
      scanf(
          "%"
          "d",
          &(k));
      scanf(
          "%"
          "d",
          &(i));
      --i;
      if (k == 1) {
        scanf(
            "%"
            "d",
            &(j));
        --j;
        printf(
            "%"
            "I64d",
            (tsum(1, i, j)));
        printf("\n"), firstout = 1;
      }
      if (k == 2) {
        scanf(
            "%"
            "d",
            &(j));
        --j;
        scanf(
            "%"
            "d",
            &(a));
        tmod(1, i, j, a);
      }
      if (k == 3) {
        scanf(
            "%"
            "d",
            &(a));
        tset(1, i, a);
      }
    }
    int res = 0;
  }
  return 0;
}