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

public class CFD {
    FastScanner in;
    PrintWriter out;

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

        SegmentTree(int n, int[] a) {
            this.n = n;
            sum = new long[n * 4];
            max = new long[n * 4];
            build(0, 0, n - 1, a);
        }

        long get(int v, int l, int r, int needL, int needR) {
            if (needR < needL)
                return 0;
            if (l == needL && r == needR)
                return sum[v];
            int m = (l + r) >>> 1;
            return get(v * 2 + 1, l, m, needL, Math.min(needR, m))
                    + get(v * 2 + 2, m + 1, r, Math.max(needL, m + 1), needR);
        }

        void mod(int v, int l, int r, int needL, int needR, int mod) {
            if (needL > needR)
                return;
            if (needL == l && needR == r) {
                if (l == r) {
                    max[v] = sum[v] %= mod;
                } else {
                    if (max[v] < mod)
                        return;
                    int m = (l + r) >>> 1;
                    mod(v * 2 + 1, l, m, l, m, mod);
                    mod(v * 2 + 2, m + 1, r, m + 1, r, mod);
                    upd(v);
                }
            } else {
                int m = (l + r) >>> 1;
                mod(v * 2 + 1, l, m, needL, Math.min(needR, m), mod);
                mod(v * 2 + 2, m + 1, r, Math.max(needL, m + 1), needR, mod);
                upd(v);
            }
        }

        void set(int v, int l, int r, int need, int val) {
            if (l == r) {
                max[v] = sum[v] = val;
            } else {
                int m = (l + r) >>> 1;
                if (m >= need) {
                    set(v * 2 + 1, l, m, need, val);
                } else {
                    set(v * 2 + 2, m + 1, r, need, val);
                }
                upd(v);
            }
        }

        void build(int v, int l, int r, int[] a) {
            if (l == r) {
                sum[v] = max[v] = a[l];
            } else {
                int m = (l + r) >>> 1;
                build(v * 2 + 1, l, m, a);
                build(v * 2 + 2, m + 1, r, a);
                upd(v);
            }
        }

        void upd(int v) {
            sum[v] = sum[v * 2 + 1] + sum[v * 2 + 2];
            max[v] = Math.max(max[v * 2 + 1], max[v * 2 + 2]);
        }
    }

    void solve() {
        int n = in.nextInt();
        int m = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }
        SegmentTree st = new SegmentTree(n, a);
        for (int i = 0; i < m; i++) {
            int type = in.nextInt();
            if (type == 1) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                out.println(st.get(0, 0, n - 1, l, r));
            } else {
                if (type == 2) {
                    int l = in.nextInt() - 1, r = in.nextInt() - 1, x = in.nextInt();
                    st.mod(0, 0, n - 1, l, r, x);
                } else {
                    st.set(0, 0,n - 1  , in.nextInt() - 1, in.nextInt());
                }
            }
        }

    }

    void run() {
        try {
            in = new FastScanner(new File("object.in"));
            out = new PrintWriter(new File("object.out"));

            solve();

            out.close();
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }

    void runIO() {

        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);

        solve();

        out.close();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public FastScanner(InputStream f) {
            br = new BufferedReader(new InputStreamReader(f));
        }

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

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

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

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

    public static void main(String[] args) {
        new CFD().runIO();
    }
}