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.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
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);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {
    static class MagicTree {
        long[] sum;
        int[] max;
        int[] data;

        public MagicTree(int[] data) {
            this.data = data;
            int n = data.length;
            sum = new long[4 * n + 10];
            max = new int[4 * n + 10];
            initTree(0, 0, n - 1);
        }

        private void initTree(int root, int rl, int rr) {
            if (rl == rr) {
                sum[root] = max[root] = data[rl];
            } else {
                int rm = (rl + rr) >> 1;
                initTree(root * 2 + 1, rl, rm);
                initTree(root * 2 + 2, rm + 1, rr);
                sum[root] = sum[root * 2 + 1] + sum[root * 2 + 2];
                max[root] = Math.max(max[root * 2 + 1], max[root * 2 + 2]);
            }
        }

        public long getSum(int l, int r) {
            return internalGetSum(0, 0, data.length - 1, l, r);
        }

        private long internalGetSum(int root, int rl, int rr, int l, int r) {
            if (l > r) return 0;
            if (rl == l && rr == r) return sum[root];
            int rm = (rl + rr) / 2;
            return internalGetSum(root * 2 + 1, rl, rm, l, Math.min(rm, r)) + internalGetSum(root * 2 + 2, rm + 1, rr, Math.max(rm + 1, l), r);
        }

        public void applyMod(int l, int r, int x) {
            internalApplyMod(0, 0, data.length - 1, l, r, x);
        }

        private void internalApplyMod(int root, int rl, int rr, int l, int r, int x) {
            if (l > r) return;
            if (max[root] < x) return;
            if (rl == rr) {
                data[rl] %= x;
                sum[root] = max[root] = data[rl];
                return;
            }
            int rm = (rl + rr) / 2;
            internalApplyMod(root * 2 + 1, rl, rm, l, Math.min(rm, r), x);
            internalApplyMod(root * 2 + 2, rm + 1, rr, Math.max(rm + 1, l), r, x);
            sum[root] = sum[root * 2 + 1] + sum[root * 2 + 2];
            max[root] = Math.max(max[root * 2 + 1], max[root * 2 + 2]);
        }

        public void setValue(int k, int x) {
            internalSetValue(0, 0, data.length - 1, k, x);
        }

        private void internalSetValue(int root, int rl, int rr, int k, int x) {
            if (rl == rr) {
                data[rl] = x;
                sum[root] = max[root] = data[rl];
                return;
            }
            int rm = (rl + rr) / 2;
            if (k <= rm)
                internalSetValue(root * 2 + 1, rl, rm, k, x);
            else
                internalSetValue(root * 2 + 2, rm + 1, rr, k, x);
            sum[root] = sum[root * 2 + 1] + sum[root * 2 + 2];
            max[root] = Math.max(max[root * 2 + 1], max[root * 2 + 2]);
        }
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();

        int[] data = new int[n];
        for (int i = 0; i < n; ++i) {
            data[i] = in.nextInt();
        }
        MagicTree t = new MagicTree(data);
        for (int i = 0; i < m; ++i) {
            int c = in.nextInt();
            if (c == 1) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                out.println(t.getSum(l, r));
            } else if (c == 2) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                int x = in.nextInt();
                t.applyMod(l, r, x);
            } else if (c == 3) {
                int k = in.nextInt() - 1;
                int x = in.nextInt();
                t.setValue(k, x);
            }
        }
    }
}

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());
    }

}