from atcoder.lazysegtree import LazySegTree N,Q = list(map(int,input().split())) A = list(map(int,input().split())) def op(x,y): xv,xl,xr = x yv,yl,yr = y if(xl != -1 and yl != -1): return (xv+yv+(xr != yl), xl, yr) elif(xl == -1): return y else: return x # v,左,右 e = (0,-1,-1) def mapping(f,x): if(x[1] != -1): return (x[0], x[1]+f, x[2]+f) else: return x def comp(f,g): return f+g id_ = 0 T = LazySegTree(op, e, mapping, comp, id_, [(0, A[i], A[i]) for i in range(N)]) for _ in range(Q): query = list(map(int,input().split())) if(query[0] == 1): _,l,r,x = query l -= 1;r -= 1 T.apply(l,r+1,x) else: _,l,r = query l -= 1;r -= 1 print(T.prod(l,r+1)[0] + 1)