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.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        new Main().run(in, out);
        out.close();
    }

    public static long mod = 17352642619633L;

    void run(FastScanner in, PrintWriter out) {

        int N = in.nextInt();
        int Q = in.nextInt();

        ST st = new ST(N);

        for (int i = 1; i <= N; i++) {
            st.set(1, i, in.nextInt());
        }

        while (Q-- > 0) {

            int q = in.nextInt();
            if (q == 1) {
                out.println(st.sum(1, in.nextInt(), in.nextInt()));
            } else if (q == 2) {
                st.mod(1, in.nextInt(), in.nextInt(), in.nextInt());
            } else {
                st.set(1, in.nextInt(), in.nextInt());
            }
        }

    }

    class ST {

        int[] lo;
        int[] hi;
        long[] max;
        long[] st;

        ST(int N) {
            lo = new int[4*N];
            hi = new int[4*N];
            max = new long[4*N];
            st = new long[4*N];

            getBounds(1, 1, N);
        }

        void getBounds(int i, int a, int b) {
            lo[i] = a;
            hi[i] = b;
            if (a==b) return;
            int m = (a+b)>>1;
            getBounds(i<<1, a, m);
            getBounds(i<<1|1, m+1, b);
        }

        void mod(int i, int a, int b, int m) {
            if (b < lo[i] || a > hi[i]) return;
            if (a <= lo[i] && hi[i] <= b) {
                if (lo[i] == hi[i]) {
                    max[i] = max[i]%m;
                    st[i] = st[i]%m;
                    return;
                }
                if (max[i] < m) return;
            }

            mod(i<<1, a, b, m);
            mod(i<<1|1, a, b, m);

            max[i] = Math.max(max[i<<1], max[i<<1|1]);
            st[i] = st[i<<1] + st[i<<1|1];
        }

        void set(int i, int a, int v) {
            if (a < lo[i] || a > hi[i]) return;
            if (a == lo[i] && a == hi[i]) {
                st[i] = v;
                max[i] = v;
                return;
            }
            set(i<<1, a, v);
            set(i<<1|1, a, v);
            max[i] = Math.max(max[i<<1], max[i<<1|1]);
            st[i] = st[i<<1]+st[i<<1|1];
        }

        long sum(int i, int a, int b) {
            if (b < lo[i] || a > hi[i]) return 0;
            if (a <= lo[i] && hi[i] <= b) {
                return st[i];
            }

            return sum(i<<1, a, b) + sum(i<<1|1, a, b);
        }

    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}