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.util.InputMismatchException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author George Marcus
 */
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 {
    Pair[] Aint;
    int[] A;
    long[] Asum;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int N = in.nextInt();
        int M = in.nextInt();
        A = new int[N];
        for(int i = 0; i < N; i++)
            A[i] = in.nextInt();
        Aint = new Pair[4 * N];
        Asum = new long[4 * N];
        init(1, 0, N - 1);

        for(int i = 0; i < M; i++) {
            int t = in.nextInt();
            if(t == 1) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                long s = querySum(1, 0, N - 1, l, r);
                out.println(s);
            }
            else if(t == 2) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                int mod = in.nextInt();
                Pair p = null;
                while((p = queryMax(1, 0, N - 1, l, r)).x >= mod) {
                    singleUpdate(1, 0, N - 1, p.idx, p.x % mod);
                }
            }
            else {
                int p = in.nextInt() - 1;
                int x = in.nextInt();
                singleUpdate(1, 0, N - 1, p, x);
            }
        }
    }

    private Pair queryMax(int k, int st, int dr, int l, int r) {
        if(l <= st && dr <= r)
            return Aint[k];

        int m = (st + dr) / 2;
        Pair ret = new Pair(-1, -1);
        if(l <= m) {
            Pair crt = queryMax(2 * k, st, m, l, r);
            if(crt.compareTo(ret) > 0)
                ret = crt;
        }
        if(r > m) {
            Pair crt = queryMax(2 * k + 1, m + 1, dr, l, r);
            if(crt.compareTo(ret) > 0)
                ret = crt;
        }

        return ret;
    }

    private long querySum(int k, int st, int dr, int l, int r) {
        if(l <= st && dr <= r)
            return Asum[k];

        int m = (st + dr) / 2;
        long ret = 0;
        if(l <= m)
            ret += querySum(2 * k, st, m, l, r);
        if(r > m)
            ret += querySum(2 * k + 1, m + 1, dr, l, r);

        return ret;
    }

    private void singleUpdate(int k, int st, int dr, int pos, int val) {
        if(st == dr) {
            Aint[k] = new Pair(val, pos);
            Asum[k] = val;
            return;
        }

        int m = (st + dr) / 2;
        if(pos <= m)
            singleUpdate(2 * k, st, m, pos, val);
        else
            singleUpdate(2 * k + 1, m + 1, dr, pos, val);

        if(Aint[2 * k].compareTo(Aint[2 * k + 1]) <= 0)
            Aint[k] = new Pair(Aint[2 * k + 1]);
        else
            Aint[k] = new Pair(Aint[2 * k]);
        Asum[k] = Asum[2 * k] + Asum[2 * k + 1];
    }

    private void init(int k, int st, int dr) {
        if(st == dr) {
            Aint[k] = new Pair(A[st], st);
            Asum[k] = A[st];
            return;
        }

        int m = (st + dr) / 2;
        init(2 * k, st, m);
        init(2 * k + 1, m + 1, dr);

        if(Aint[2 * k].compareTo(Aint[2 * k + 1]) <= 0)
            Aint[k] = new Pair(Aint[2 * k + 1]);
        else
            Aint[k] = new Pair(Aint[2 * k]);
        Asum[k] = Asum[2 * k] + Asum[2 * k + 1];
    }

    private class Pair implements Comparable<Pair> {
        public int x;
        public int idx;

        private Pair(int x, int idx) {
            this.x = x;
            this.idx = idx;
        }

        public Pair(Pair pair) {
            this(pair.x, pair.idx);
        }

        public int compareTo(Pair o) {
            if(x != o.x)
                return x - o.x;
            return idx - o.idx;
        }
    }
}

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() {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

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

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuffer res = new StringBuffer();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));

        return res.toString();
    }

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

}