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.PrintWriter;
import java.util.InputMismatchException;
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 {
    int[] max;
    long[] sum;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.readInt();
        int m = in.readInt();
        int[] a = IOUtils.readIntArray(in, n);
        max = new int[4 * n];
        sum = new long[4 * n];
        init(a, 0, 0, n - 1);
        for (int q = 0; q < m; ++q) {
            int type = in.readInt();
            if (type == 1) {
                int l = in.readInt() - 1;
                int r = in.readInt() - 1;
                out.println(getSum(0, 0, n - 1, l, r));
            } else if (type == 2) {
                int l = in.readInt() - 1;
                int r = in.readInt() - 1;
                int x = in.readInt();
                updateMod(0, 0, n - 1, l, r, x);
            } else {
                int k = in.readInt() - 1;
                int v = in.readInt();
                updateValue(0, 0, n - 1, k, v);
            }
        }
    }

    void init(int[] a, int node, int b, int e) {
        if (b == e) {
            sum[node] = max[node] = a[b];
            return;
        }
        int l = (node << 1) | 1;
        int r = l + 1;
        int mid = (b + e) / 2;
        init(a, l, b, mid);
        init(a, r, mid + 1, e);
        sum[node] = sum[l] + sum[r];
        max[node] = Math.max(max[l], max[r]);
    }

    long getSum(int node, int b, int e, int rangeStart, int rangeEnd) {
        if (b >= rangeStart && e <= rangeEnd) {
            return sum[node];
        } else if (e < rangeStart || b > rangeEnd) {
            return 0;
        } else {
            int mid = (b + e) >> 1;
            int l = (node << 1) | 1;
            int r = l + 1;
            return getSum(l, b, mid, rangeStart, rangeEnd) + getSum(r, mid + 1, e, rangeStart, rangeEnd);
        }
    }

    void updateValue(int node, int b, int e, int ind, int val) {
        if (e < ind || b > ind) {
            return;
        } else if (b == e) {
            sum[node] = val;
            max[node] = val;
            return;
        } else {
            int mid = (b + e) >> 1;
            int l = (node << 1) | 1;
            int r = l + 1;
            updateValue(l, b, mid, ind, val);
            updateValue(r, mid + 1, e, ind, val);

            sum[node] = sum[l] + sum[r];
            max[node] = Math.max(max[l], max[r]);
        }
    }

    void updateMod(int node, int b, int e, int rangeStart, int rangeEnd, int mod) {
        if (b >= rangeStart && e <= rangeEnd) {
            if (max[node] < mod) {
                return;
            }
        }

        if (e < rangeStart || b > rangeEnd) {
            return;
        } else if (b == e) {
            sum[node] %= mod;
            max[node] %= mod;
            return;
        } else {
            int mid = (b + e) >> 1;
            int l = (node << 1) | 1;
            int r = l + 1;
            updateMod(l, b, mid, rangeStart, rangeEnd, mod);
            updateMod(r, mid + 1, e, rangeStart, rangeEnd, mod);

            sum[node] = sum[l] + sum[r];
            max[node] = Math.max(max[l], max[r]);
        }
    }
}

class InputReader {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        // InputMismatchException -> UnknownError
        if (numChars == -1)
            throw new UnknownError();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new UnknownError();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public int readInt() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        } else if (c == '+') {
            c = read();
        }
        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public static boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

}

class IOUtils {

    public static int[] readIntArray(InputReader in, int size) {
        int[] res = new int[size];
        for (int i = 0; i < size; ++i) {
            res[i] = in.readInt();
        }
        return res;
    }

}