import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		long t = System.currentTimeMillis();
		new Main().run();
		System.err.println(System.currentTimeMillis() - t);
	}
	
	class SegTree{
		int n=1;
		long[][] v;
		
		public SegTree(int n_) {
			while(n<n_)n*=2;
			v=new long[2*n][3];//[F,left,right]
		}
		
		void add(int k,long add) {
			k+=n;
			if(k>=v.length)return;
			v[k][0]=1;
			v[k][1]+=add;
			v[k][2]+=add;
			while(k!=1) {
				k=k/2;
				v[k]=merge(v[2*k],v[2*k+1]);
			}
		}
		
		long[] merge(long[] L,long[] R) {
			if(L[0]==0)return R;
			else if(R[0]==0)return L;
			else return new long[] {L[0]+R[0]+(R[1]==0?-1:0),L[1],R[2]};
		}
		
		int query(int a,int b) {
			return (int)query(1,n+1,a+1,b+1,1)[0];
		}
		
		long[] query(int l,int r,int a,int b,int k) {
			if(r<=a||b<=l)return new long[] {0,0,0};
			else if(a<=l&&r<=b)return v[k];
			else {
				long[] vl=query(l,(l+r)/2,a,b,2*k);
				long[] vr=query((l+r)/2,r,a,b,2*k+1);
				return merge(vl,vr);
			}
		}
	}
	
	
	void run() {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt();
		int Q=sc.nextInt();
		long[] A=new long[N];
		for(int i=0;i<N;++i)A[i]=sc.nextLong();
		SegTree seg=new SegTree(N);
		for(int i=0;i<N;++i) {
			seg.add(i, A[i]-(i>0?A[i-1]:0));
		}
		while(Q-->0) {
			int t=sc.nextInt();
			int l=sc.nextInt();
			int r=sc.nextInt();
			--l;--r;
			if(t==1) {
				long x=sc.nextLong();
				seg.add(l, x);
				seg.add(r+1, -x);
			}else {
				System.out.println(seg.query(l, r+1));
			}
		}
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}
	
	
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    
    public int nextInt() {
    	return (int)nextLong();
    }
}