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.util.Arrays;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	static Node num[]=new Node[1000000];
	static int sum[];
	static long res;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in=new Scanner(System.in);
		int n=in.nextInt();
		int m=in.nextInt();
		sum=new int[n+1];
		for(int i=1;i<n+1;i++){
			sum[i]=in.nextInt();
		}
		init(1,n,1);
		for(int i=0;i<m;i++){
			res=0;
			int k=in.nextInt();
			if(k==1){
				int l=in.nextInt();
				int r=in.nextInt();
				list(l,r,1);
				System.out.println(res);
			}else if(k==2){
				int l=in.nextInt();
				int r=in.nextInt();
				int x=in.nextInt();
				mod(l,r,x,1);
			}else{
				int l=in.nextInt();
				int x=in.nextInt();
				change(l,l,x,1);
			}
		}
	}
	static void change(int l,int r,int x,int i){
		if(num[i].l==num[i].r){
			num[i].sum=x;
			num[i].max=x;
			return;
		}
		int mid=(num[i].l+num[i].r)/2;
		if(mid<l){
			change(l,r,x,2*i+1);
			num[i].sum=num[2*i].sum+num[2*i+1].sum;
			num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
		}else if(mid>=r){
			change(l,r,x,2*i);
			num[i].sum=num[2*i].sum+num[2*i+1].sum;
			num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
		}
	}
	static void mod(int l,int r,int x,int i){
		if(num[i].l==num[i].r){
			num[i].sum=num[i].sum%x;
			num[i].max=num[i].max%x;
			return;
		}
		if(num[i].max<x)return;
		int mid=(num[i].l+num[i].r)/2;
		if(mid<l){
			mod(l,r,x,2*i+1);
			num[i].sum=num[2*i].sum+num[2*i+1].sum;
			num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
		}else if(mid>=r){
			mod(l,r,x,2*i);
			num[i].sum=num[2*i].sum+num[2*i+1].sum;
			num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
		}else{
			mod(l,mid,x,2*i);
			mod(mid+1,r,x,2*i+1);
			num[i].sum=num[2*i].sum+num[2*i+1].sum;
			num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
		}
	}
	static void list(int l,int r,int i){
		if(num[i].l==l &&num[i].r==r){
			res+=num[i].sum;
			return;
		}
		int mid=(num[i].l+num[i].r)/2;
		if(mid<l){
			list(l,r,2*i+1);
		}else if(mid>=r){
			list(l,r,2*i);
		}else{
			list(l,mid,2*i);
			list(mid+1,r,2*i+1);
		}
	}
	static void init(int l,int r,int i){
		num[i]=new Node();
		num[i].l=l;
		num[i].r=r;
		if(l==r){
			num[i].max=sum[l];
			num[i].sum=(long)sum[l];
			return;
		}
		int mid=(l+r)/2;
		init(l,mid,2*i);
		init(mid+1,r,2*i+1);
		num[i].sum=num[2*i].sum+num[2*i+1].sum;
		num[i].max=Math.max(num[2*i].max, num[2*i+1].max);
	}
	
}
class Node{
	int l,r;
	int max;
	long sum;
}