import java.io.PrintWriter;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	class Tree {
		int n=1;
		long[] sum;
		long[] sum_parity;		
		long[] lazy;
		int erase=-1;
		
		public Tree(int n_) {
			while (n<n_) n*=2;
			sum=new long[2*n-1];
			sum_parity=new long[2*n-1];
			lazy=new long[2*n-1];
		}
		
		void push(int k,int l,int r) {
			if (lazy[k]==erase) {
				sum[k]=sum_parity[k];
			} else {
				sum[k]+=lazy[k]*(r-l);
				if (lazy[k]%2==1) {
					sum_parity[k]=r-l-sum_parity[k];
				}
			}
			if (2*k+1<sum.length) {
				if (lazy[k]==erase) {
					lazy[2*k+1]=erase;
					lazy[2*k+2]=erase;
				} else {
					lazy[2*k+1]+=lazy[k];
					lazy[2*k+2]+=lazy[k];
				}
			}
			lazy[k]=0;
		}
		
		void erase(int a,int b) {
			query(0,n,a,b,0,erase);
		}
		
		void add(int a,int b,long val) {
			query(0,n,a,b,0,val);
		}
		
		long query(int a,int b) {
			return query(0,n,a,b,0,0);
		}
		
		long query(int l,int r,int a,int b,int k,long add) {
			push(k,l,r);
			if (r<=a||b<=l) return 0;
			else if (a<=l&&r<=b) {
				lazy[k]=add;
				push(k,l,r);
				return sum[k];
			} else {
				long vl=query(l,(l+r)/2,a,b,2*k+1,add);
				long vr=query((l+r)/2,r,a,b,2*k+2,add);
				sum[k]=sum[2*k+1]+sum[2*k+2];
				sum_parity[k]=sum_parity[2*k+1]+sum_parity[2*k+2];
				return vl+vr;
			}
		}
		
	}
	
	void run() {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt();
		int Q=sc.nextInt();
		long[] A=new long[N];
		Tree tree=new Tree(N);
		for (int i=0;i<N;++i) {
			A[i]=sc.nextLong();
			tree.add(i, i+1, A[i]);
		}
		PrintWriter pw=new PrintWriter(System.out);
		for (int i=0;i<Q;++i) {
			int t=sc.nextInt();
			int l=sc.nextInt()-1;
			int r=sc.nextInt();
			if (t==1) {
				tree.erase(l,r);
			} else if (t==2) {
				long x=sc.nextLong();
				tree.add(l, r, x);
			} else {
				pw.println(tree.query(l, r));
			}
		}
		pw.flush();
	}
}