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.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.Reader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Ruins He
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    OutputWriter out = new OutputWriter(outputStream);
    TaskD solver = new TaskD();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskD {
    private long[] sum;
    private int[] max;
    private long[] a;
    private int n;

    public void solve(int testNumber, InputReader in, OutputWriter out) {
      n = in.nextInt();
      int m = in.nextInt();
      a = new long[n + 1];
      sum = new long[n + 1];
      max = new int[n << 2];
      for (int i = 1; i <= n; i++) {
        a[i] = in.nextLong();
        add(i, a[i]);
      }
      build(1, 1, n);
      for (int i = 0; i < m; i++) {
        int op = in.nextInt();
        int l = in.nextInt();
        int r = in.nextInt();
        if (op == 1) {
          out.println(query(r) - query(l - 1));
        } else if (op == 2) {
          int v = in.nextInt();
          while (true) {
            int id = query(1, 1, n, l, r);
            if (a[id] < v) break;
            add(id, a[id] % v - a[id]);
            a[id] %= v;
            update(1, 1, n, id);
          }
        } else {
          add(l, r - a[l]);
          a[l] = r;
          update(1, 1, n, l);
        }
      }
    }

    private void update(int k, int l, int r, int p) {
      if (l == r) {
        max[k] = p;
        return;
      }
      int mid = (l + r) >> 1;
      if (p <= mid) update(k << 1, l, mid, p);
      else update(k << 1 | 1, mid + 1, r, p);
      max[k] = a[max[k << 1]] >= a[max[k << 1 | 1]] ? max[k << 1] : max[k << 1 | 1];
    }

    private int query(int k, int l, int r, int ll, int rr) {
      if (l == ll && r == rr) {
        return max[k];
      }
      int mid = (l + r) >> 1;
      if (rr <= mid) return query(k << 1, l, mid, ll, rr);
      else if (ll > mid) return query(k << 1 | 1, mid + 1, r, ll, rr);
      else {
        int lhs = query(k << 1, l, mid, ll, mid);
        int rhs = query(k << 1 | 1, mid + 1, r, mid + 1, rr);
        return a[lhs] >= a[rhs] ? lhs : rhs;
      }
    }

    private long query(int k) {
      long res = 0;
      while (k > 0) {
        res += sum[k];
        k -= k & -k;
      }
      return res;
    }

    private void add(int k, long v) {
      while (k <= n) {
        sum[k] += v;
        k += k & -k;
      }
    }

    private void build(int k, int l, int r) {
      if (l == r) {
        max[k] = l;
        return;
      }
      int mid = (l + r) >> 1;
      build(k << 1, l, mid);
      build(k << 1 | 1, mid + 1, r);
      max[k] = a[max[k << 1]] >= a[max[k << 1 | 1]] ? max[k << 1] : max[k << 1 | 1];
    }

  }

  static class InputReader {
    public final BufferedReader reader;
    public StringTokenizer tokenizer = null;

    public InputReader(Reader reader) {
      this.reader = new BufferedReader(reader);
    }

    public InputReader(InputStream inputStream) {
      this(new InputStreamReader(inputStream));
    }

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

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

  }

  static class OutputWriter {
    private final PrintWriter writer;

    private OutputWriter(Writer writer, boolean autoFlush) {
      this.writer = new PrintWriter(new BufferedWriter(writer), autoFlush);
    }

    public OutputWriter(Writer writer) {
      this(writer, true);
    }

    public OutputWriter(OutputStream outputStream) {
      this(new OutputStreamWriter(outputStream), false);
    }

    public OutputWriter println(long value) {
      writer.println(value);
      return this;
    }

    public void close() {
      writer.close();
    }

  }
}