package contest190906;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Random;

public class E2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q =ni();
		int[] a = na(n);

		Node[] roots = new Node[2];
		
		for(int i = 0;i < n;i++){
			roots[a[i] % 2] = merge(roots[a[i] % 2], new Node(i, a[i]/2*2));
		}
		for(int z = 0;z < Q;z++){
			int t = ni();
			if(t == 1){
				int l = ni()-1, r = ni()-1;
				for(int k = 0;k < 2;k++){
					int low = lowerBound(roots[k], l);
					int high = lowerBound(roots[k], r+1);
//					tr("lh", low, high);
//					tr(toString(roots[k], ""));
					update(roots[k], low, high, 0L);
//					tr(toString(roots[k], ""));
				}
			}else if(t == 2){
				int l = ni()-1, r = ni()-1;
				int x = ni();
				int[] lows = new int[2];
				int[] highs = new int[2];
				for(int k = 0;k < 2;k++){
					int low = lowerBound(roots[k], l);
					int high = lowerBound(roots[k], r+1);
					add(roots[k], low, high, (x+k)/2*2);
					lows[k] = low; highs[k] = high;
				}
//				tr(lows, highs);
//				tr();
//				tr(toString(roots[0], ""));
//				tr(toString(roots[1], ""));
//				tr();
				if(x % 2 == 1){
					Node[] lm_r0 = split(roots[0], highs[0]);
					Node[] l_m0 = split(lm_r0[0], lows[0]);
					Node[] lm_r1 = split(roots[1], highs[1]);
					Node[] l_m1 = split(lm_r1[0], lows[1]);
//					tr();
//					tr(toString(l_m0[1], ""));
//					tr(toString(l_m1[1], ""));
//					tr();
					roots[0] = merge(merge(l_m0[0], l_m1[1]), lm_r0[1]);
					roots[1] = merge(merge(l_m1[0], l_m0[1]), lm_r1[1]);
				}
			}else{
				int l = ni()-1, r = ni()-1;
				
				long ans = 0;
				for(int k = 0;k < 2;k++){
					int low = lowerBound(roots[k], l);
					int high = lowerBound(roots[k], r+1);
					ans += sum(roots[k], low, high);
//					tr(k, ans);
					if(k == 1){
						Node[] lm_r = split(roots[1], high);
						Node[] l_m = split(lm_r[0], low);
						ans += count(l_m[1]);
						roots[1] = merge(merge(l_m[0], l_m[1]), lm_r[1]);
					}
//					tr(k, ans);
				}
				out.println(ans);
			}
//			tr();
//			tr(toString(roots[0], ""));
//			tr(toString(roots[1], ""));
//			tr();
		}
	}
	
	public static Random gen = new Random(114514);
	
	public static long I = Long.MIN_VALUE;
	static public class Node
	{
		public int id;
		public long v; // value
		public long priority;
		public Node left, right, parent;
		
		public int count;
		
		public long add;
		public long sum;
		public long cover;
		
		public Node(int id, int v)
		{
			this.id = id;
			this.v = v;
			this.cover = I;
			priority = gen.nextLong();
			update(this);
		}
		
		@Override
		public String toString() {
			StringBuilder builder = new StringBuilder();
			builder.append("Node [v=");
			builder.append(v);
			builder.append(", count=");
			builder.append(count);
			builder.append(", parent=");
			builder.append(parent != null ? parent.v : "null");
			builder.append(",id=");
			builder.append(id);
			builder.append(", add=");
			builder.append(add);
			builder.append(", sum=");
			builder.append(sum);
			builder.append(", cov=");
			builder.append(cover);
			builder.append("]");
			return builder.toString();
		}
	}

	public static Node update(Node a)
	{
		if(a == null)return null;
		a.count = 1;
		if(a.left != null)a.count += a.left.count;
		if(a.right != null)a.count += a.right.count;
		
		if(a.cover != I){
			a.v = a.cover;
			a.sum = a.v * a.count + a.add * a.count;
		}else{
			a.sum = a.v + a.add * a.count;
			if(a.left != null)a.sum += a.left.sum;
			if(a.right != null)a.sum += a.right.sum;
		}
		return a;
	}
	
	static Node fall(Node a)
	{
		if(a == null)return null;
		if(a.cover != I){
			if(a.left != null){
				a.left.cover = a.cover;
				a.left.add = 0L;
			}
			if(a.right != null){
				a.right.cover = a.cover;
				a.right.add = 0L;
			}
			a.cover = I;
		}
		a.v += a.add;
		if(a.left != null){
			a.left.add += a.add;
		}
		if(a.right != null){
			a.right.add += a.add;
		}
		update(a.left);
		update(a.right);
		a.add = 0;
		return update(a);
	}
	
	public static Node disconnect(Node a)
	{
		if(a == null)return null;
		a.left = a.right = a.parent = null;
		return update(a);
	}
	
	public static Node root(Node x)
	{
		if(x == null)return null;
		while(x.parent != null)x = x.parent;
		return x;
	}
	
	public static int count(Node a)
	{
		return a == null ? 0 : a.count;
	}
	
	public static void setParent(Node a, Node par)
	{
		if(a != null)a.parent = par;
	}
	
	public static long sum(Node a, int L, int R)
	{
		if(a == null || L >= R || L >= count(a) || R <= 0)return 0L;
//		tr(L, R, count(a), a.v, a.sum, a.cover);
		if(L <= 0 && R >= count(a)){
//			tr(a.v, a.sum, a.cover, a.count);
			return a.sum;
		}else{
			fall(a);
			long ret = 0;
			ret += sum(a.left, L, R);
			ret += sum(a.right, L-count(a.left)-1, R-count(a.left)-1);
			if(L <= count(a.left) && count(a.left) < R)ret += a.v;
			ret += (Math.min(R, a.count) - L) * a.add;
			return ret;
		}
	}
	
	public static void add(Node a, int L, int R, long V)
	{
		if(a == null || L >= R || L >= count(a) || R <= 0)return;
		if(L <= 0 && R >= count(a)){
			a.add += V;
		}else{
			fall(a);
			add(a.left, L, R, V);
			add(a.right, L-count(a.left)-1, R-count(a.left)-1, V);
			if(L <= count(a.left) && count(a.left) < R)a.v += V;
		}
		update(a);
	}
	
	public static void update(Node a, int L, int R, long V)
	{
		if(a == null || L >= R || L >= count(a) || R <= 0)return;
		if(L <= 0 && R >= count(a)){
			a.cover = V;
			a.add = 0;
		}else{
			fall(a);
//			tr(a);
			update(a.left, L, R, V);
			update(a.right, L-count(a.left)-1, R-count(a.left)-1, V);
			if(L <= count(a.left) && count(a.left) < R){
				a.v = V;
			}
		}
		update(a);
	}
	
	public static Node merge(Node a, Node b)
	{
		if(b == null)return a;
		if(a == null)return b;
		if(a.priority > b.priority){
			fall(a);
			setParent(a.right, null);
			setParent(b, null);
			a.right = merge(a.right, b);
			setParent(a.right, a);
			return update(a);
		}else{
			fall(b);
			setParent(a, null);
			setParent(b.left, null);
			b.left = merge(a, b.left);
			setParent(b.left, b);
			return update(b);
		}
	}
	
	// [0,K),[K,N)
	public static Node[] split(Node a, int K)
	{
		if(a == null)return new Node[]{null, null};
		fall(a);
		if(K <= count(a.left)){
			setParent(a.left, null);
			Node[] s = split(a.left, K);
			a.left = s[1];
			setParent(a.left, a);
			s[1] = update(a);
			return s;
		}else{
			setParent(a.right, null);
			Node[] s = split(a.right, K-count(a.left)-1);
			a.right = s[0];
			setParent(a.right, a);
			s[0] = update(a);
			return s;
		}
	}
	
	public static Node insert(Node a, int K, Node b)
	{
		if(a == null)return b;
		fall(a);
		if(b.priority < a.priority){
			if(K <= count(a.left)){
				a.left = insert(a.left, K, b);
				setParent(a.left, a);
			}else{
				a.right = insert(a.right, K-count(a.left)-1, b);
				setParent(a.right, a);
			}
			return update(a);
		}else{
			Node[] ch = split(a, K);
			b.left = ch[0]; b.right = ch[1];
			setParent(b.left, b);
			setParent(b.right, b);
			return update(b);
		}
	}
	
	// delete K-th
	public static Node erase(Node a, int K)
	{
		if(a == null)return null;
		if(K < count(a.left)){
			a.left = erase(a.left, K);
			setParent(a.left, a);
			return update(a);
		}else if(K == count(a.left)){
			fall(a);
			setParent(a.left, null);
			setParent(a.right, null);
			Node aa = merge(a.left, a.right);
			disconnect(a);
			return aa;
		}else{
			a.right = erase(a.right, K-count(a.left)-1);
			setParent(a.right, a);
			return update(a);
		}
	}
	
	public static Node get(Node a, int K)
	{
		while(a != null){
			if(K < count(a.left)){
				a = a.left;
			}else if(K == count(a.left)){
				break;
			}else{
				K = K - count(a.left)-1;
				a = a.right;
			}
		}
		return a;
	}
	
	public static int lowerBound(Node a, int q)
	{
		int lcount = 0;
		while(a != null){
			fall(a);
			if(a.id == q){
				lcount += count(a.left);
				break;
			}
			if(q < a.id){
				a = a.left;
			}else{
				lcount += count(a.left) + 1;
				a = a.right;
			}
		}
		return lcount;
	}
	
	public static int index(Node a)
	{
		if(a == null)return -1;
		int ind = count(a.left);
		while(a != null){
			Node par = a.parent;
			if(par != null && par.right == a){
				ind += count(par.left) + 1;
			}
			a = par;
		}
		return ind;
	}
	
	public static Node[] nodes(Node a) { return nodes(a, new Node[count(a)], 0, count(a)); }
	public static Node[] nodes(Node a, Node[] ns, int L, int R)
	{
		if(a == null)return ns;
		nodes(a.left, ns, L, L+count(a.left));
		ns[L+count(a.left)] = a;
		nodes(a.right, ns, R-count(a.right), R);
		return ns;
	}
	
	public static String toString(Node a, String indent)
	{
		if(a == null)return "";
		StringBuilder sb = new StringBuilder();
		sb.append(toString(a.left, indent + "  "));
		sb.append(indent).append(a).append("\n");
		sb.append(toString(a.right, indent + "  "));
		return sb.toString();
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}