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.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Vadim Semenov
 */
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 {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int counter = in.nextInt();
        int queries = in.nextInt();
        int[] initial = new int[counter];
        for (int i = 0; i < counter; i++) initial[i] = in.nextInt();
        SegmentTree tree = new SegmentTree(initial);
        for (int query = 0; query < queries; query++) {
            int type = in.nextInt();
            if (type == 1) {
                int from = in.nextInt() - 1;
                int to = in.nextInt();
                out.println(tree.sumQuery(from, to));
            } else if (type == 2) {
                int from = in.nextInt() - 1;
                int to = in.nextInt();
                int mod = in.nextInt();
                tree.modQuery(from, to, mod);
            } else if (type == 3) {
                int at = in.nextInt() - 1;
                int value = in.nextInt();
                tree.updateQuery(at, value);
            } else throw new AssertionError(type);
        }
    }
}

class SegmentTree {
    private int size;
    private long[] data;
    private long[] max;

    public SegmentTree(int[] data) {
        size = Integer.highestOneBit(data.length) << 1;
        this.data = new long[(size << 1)];
        this.max = new long[(size << 1)];
        Arrays.fill(this.max, Long.MIN_VALUE);
        for (int i = 0; i < data.length; i++) {
            this.data[size + i] = data[i];
            this.max[size + i] = data[i];
        }
        for (int i = size - 1; i > 0; i--) {
            this.data[i] = this.data[i << 1] + this.data[(i << 1) | 1];
            this.max[i] = Math.max(this.max[i << 1], this.max[(i << 1) | 1]);
        }
    }

    public void updateQuery(int at, long value) {
        internalUpdateQuery(1, at, 0, size, value);
    }

    private void internalUpdateQuery(int index, int at, int left, int right, long value) {
        if (left > at || right <= at) return;
        if (right - left == 1) {
            data[index] = value;
            max[index] = value;
            return;
        }
        int middle = (left + right) >>> 1;
        internalUpdateQuery(index << 1, at, left, middle, value);
        internalUpdateQuery((index << 1) | 1, at, middle, right, value);
        recalc(index);
    }

    public void modQuery(int from, int to, int mod) {
        internalModQuery(1, from, to, 0, size, mod);
    }

    private void internalModQuery(int index, int from, int to, int left, int right, int mod) {
        if (to <= left || right <= from) return;
        if (right - left == 1) {
            data[index] %= mod;
            max[index] = data[index];
            return;
        }
        int middle = (left + right) >>> 1;
        if (max[index << 1] >= mod) internalModQuery(index << 1, from, to, left, middle, mod);
        if (max[(index << 1) | 1] >= mod) internalModQuery((index << 1) | 1, from, to, middle, right, mod);
        recalc(index);
    }

    public long sumQuery(int from, int to) {
        return internalSumQuery(1, from, to, 0, size);
    }

    private long internalSumQuery(int index, int from, int to, int left, int right) {
        if (right <= from || to <= left) return 0;
        if (from <= left && right <= to) return data[index];
        int middle = (left + right) >>> 1;
        return internalSumQuery(index << 1, from, to, left, middle) +
                internalSumQuery((index << 1) | 1, from, to, middle, right);
    }

    private void recalc(int idx) {
        data[idx] = data[idx << 1] + data[(idx << 1) | 1];
        max[idx] = Math.max(max[idx << 1], max[(idx << 1) | 1]);
    }
}

class InputReader {
    private final BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
    }

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

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(readLine());
        }
        return tokenizer.nextToken();
    }

    public String readLine() {
        String line = null;
        try {
            line = reader.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return line;
    }
}