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


public class Main {
    static int inf = (int) 1e9 + 7;


    public static void main(String[] args) throws IOException {
        sc = new Scanner(System.in);
        pw = new PrintWriter(System.out);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int temp[] = new int[n];
        for(int i = 0;i < n;i++) temp[i] = sc.nextInt();
        segment_tree a = new segment_tree(temp);

        for(int i = 0;i < m;i++) {
            int t = sc.nextInt();
            if (t == 1) {
                int l = sc.nextInt() - 1;
                int r = sc.nextInt() - 1;
                pw.println(a.get(l, r));
            }
            if (t == 2) {
                int l = sc.nextInt() - 1;
                int r = sc.nextInt() - 1;
                int x = sc.nextInt();
                a.mod(l, r, x);
            }
            if (t == 3) {
                int l = sc.nextInt() - 1;
                int x = sc.nextInt();
                a.set(l, x);
            }
        }

        pw.close();
    }

    static Scanner sc;
    static PrintWriter pw;

    static class Scanner {
        BufferedReader br;
        StringTokenizer st = new StringTokenizer("");

        Scanner(InputStream in) throws FileNotFoundException {
            br = new BufferedReader(new InputStreamReader(in));
        }

        Scanner(String in) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(in));
        }

        String next() throws IOException {
            while (!st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

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

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }
}

class segment_tree {
    int max[];
    long sum[];
    int last;

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

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

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

    void set(int k, int x) {
        set(0, 0, last, k, x);
    }

    void set(int v, int l, int r, int k, int x) {
        if (l > k || r < k) return;
        if (l == k && r == k) {
            sum[v] = x;
            max[v] = x;
            return;
        }
        int m = ((l + r) >> 1);
        set(v * 2 + 1, l, m, k, x);
        set(v * 2 + 2, m + 1, r, k, x);

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

    long get(int l, int r) {
        return get(0, 0, last, l, r);
    }

    long get(int v, int l, int r, int left, int right) {
        if (l > right || r < left) return 0;
        if (l >= left && r <= right) return sum[v];
        int m = ((l + r) >> 1);
        return get(v * 2 + 1, l, m, left, right) + get(v * 2 + 2, m +  1, r, left, right);
    }

    void mod(int l, int r, int x) {
        mod(0, 0, last, l, r, x);
    }

    void mod(int v, int l, int r, int left, int right, int x) {
        if (l > right || r < left) return;
        if (max[v] < x) return;
        if (l == r) {
            sum[v] %= x;
            max[v] %= x;
            return;
        }
        int m = ((l + r) >> 1);
        mod(v * 2 + 1, l, m, left, right, x);
        mod(v * 2 + 2, m + 1, r, left, right, x);

        max[v] = Math.max(max[v * 2 + 1], max[v * 2 + 2]);
        sum[v] = sum[v * 2 + 1] + sum[v * 2 + 2];

    }


}