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



class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	class Tree {
		int n=1;
		int n_;
		long[] sum;
		int[] sum_parity;		
		ArrayDeque<Long>[] lazy;
		long erase=-1;
		
		public Tree(int n_) {
			while (n<n_) n*=2;
			this.n_=n_;
			sum=new long[2*n-1];
			sum_parity=new int[2*n-1];
			lazy=new ArrayDeque[2*n-1];
			for (int i=0;i<lazy.length;++i) lazy[i]=new ArrayDeque<Long>();
		}
		
		void push(int k,int l,int r) {
			while (!lazy[k].isEmpty()) {
				long key=lazy[k].pollFirst();
				if (key==erase) {
					sum[k]=sum_parity[k];
				} else {
					sum[k]+=key*(r-l);
					if (key%2==1) {
						sum_parity[k]=r-l-sum_parity[k];
					}
				}
				if (2*k+1<sum.length) {
					if (key==erase) {
						while (!lazy[2*k+1].isEmpty() && lazy[2*k+1].peekLast()==erase) {
							lazy[2*k+1].pollLast();
						}
						while (!lazy[2*k+1].isEmpty() && lazy[2*k+1].peekFirst()==erase) {
							lazy[2*k+1].pollFirst();
						}
						while (!lazy[2*k+2].isEmpty() && lazy[2*k+2].peekLast()==erase) {
							lazy[2*k+2].pollLast();
						}
						while (!lazy[2*k+2].isEmpty() && lazy[2*k+2].peekLast()==erase) {
							lazy[2*k+2].pollLast();
						}
						lazy[2*k+1].addLast(erase);
						lazy[2*k+2].addLast(erase);
					} else {
						if (!lazy[2*k+1].isEmpty() && lazy[2*k+1].peekLast()!=erase) {
							lazy[2*k+1].add(lazy[2*k+1].pollLast()+key);
						} else {
							lazy[2*k+1].add(key);
						}
						if (!lazy[2*k+2].isEmpty() && lazy[2*k+2].peekLast()!=erase) {
							lazy[2*k+2].add(lazy[2*k+2].pollLast()+key);
						} else {
							lazy[2*k+2].add(key);
						}
					}
				}
			}
		}
		
		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].addLast(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();
		Tree tree=new Tree(N);
		for (int i=0;i<N;++i) {
			long A=Integer.parseInt(sc.next());
			tree.add(i, i+1, A);
		}
		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();
	}
}