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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TheChildAndSequence solver = new TheChildAndSequence();
        solver.solve(1, in, out);
        out.close();
    }

    static class TheChildAndSequence {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt();
            int M = in.nextInt();
            int[] arr = new int[N];
            for (int i = 0; i < N; i++) {
                arr[i] = in.nextInt();
            }
            SegmentTree seg = new SegmentTree(arr);
            while (M-- > 0) {
                int t = in.nextInt();
                if (t == 1) {
                    out.println(seg.sum(1, 0, N - 1, in.nextInt() - 1, in.nextInt() - 1));
                } else if (t == 2) {
                    seg.mod(1, 0, N - 1, in.nextInt() - 1, in.nextInt() - 1, in.nextInt());
                } else {
                    seg.replace(1, 0, N - 1, in.nextInt() - 1, in.nextInt());
                }
            }
        }

        class SegmentTree {
            long[] sum;
            long[] max;

            SegmentTree(int[] arr) {
                int N = arr.length;
                sum = new long[4 * N];
                max = new long[4 * N];
                for (int i = 0; i < N; i++) {
                    replace(1, 0, N - 1, i, arr[i]);
                }
            }

            void replace(int n, int tl, int tr, int i, int val) {
                if (tl == tr) {
                    max[n] = val;
                    sum[n] = val;
                    return;
                }
                int tm = (tl + tr) / 2;
                if (tm >= i) {
                    replace(2 * n, tl, tm, i, val);
                } else {
                    replace(2 * n + 1, tm + 1, tr, i, val);
                }
                sum[n] = sum[2 * n] + sum[2 * n + 1];
                max[n] = Math.max(max[2 * n], max[2 * n + 1]);
            }

            void mod(int n, int tl, int tr, int l, int r, int mod) {
                if (max[n] < mod || tr < l || tl > r) {
                    return;
                }
                if (tl == tr) {
                    sum[n] = max[n] % mod;
                    max[n] %= mod;
                    return;
                }
                int tm = (tl + tr) / 2;
                mod(2 * n, tl, tm, l, r, mod);
                mod(2 * n + 1, tm + 1, tr, l, r, mod);
                sum[n] = sum[2 * n] + sum[2 * n + 1];
                max[n] = Math.max(max[2 * n], max[2 * n + 1]);
            }

            long sum(int n, int tl, int tr, int l, int r) {
                if (l <= tl && tr <= r) {
                    return sum[n];
                }
                if (r < tl || l > tr) {
                    return 0;
                }
                int tm = (tl + tr) / 2;
                return sum(2 * n, tl, tm, l, r) + sum(2 * n + 1, tm + 1, tr, l, r);
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}