import sequtils
# import algorithm,math,tables
# import times,macros,queues,bitops,strutils,intsets,sets
# import rationals,critbits,ropes,nre,pegs,complex,stats,heapqueue,sugar
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)
# template stopwatch(body) = (let t1 = cpuTime();body;stderr.writeLine "TIME:",(cpuTime() - t1) * 1000,"ms")
# proc `^`(n:int) : int{.inline.} = (1 shl n)
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" ,discardable.}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': return
    result = 10 * result + k.ord - '0'.ord

type BinaryIndexedTree[T] = ref object
  data: seq[T]
proc newBinaryIndexedTree[T](n:int):BinaryIndexedTree[T] =
  new(result)
  result.data = newSeq[T](n)
proc len[T](self:BinaryIndexedTree[T]): int = self.data.len()
proc plus[T](self:var BinaryIndexedTree[T],i:int,val:T) =
  var i = i
  while i < self.len():
    self.data[i] += val
    i = i or (i + 1)
proc `[]`[T](self:BinaryIndexedTree[T],i:int): T =
  var i = i
  while i >= 0:
    result += self.data[i]
    i = (i and (i + 1)) - 1
proc `$`[T](self:BinaryIndexedTree[T]): string =
  result = "["
  for i in 0..<self.len.min(100): result &= $(self[i]) & ", "
  return result[0..result.len()-2] & (if self.len > 100 : " ...]" else: "]")


let n = scan()
let q = scan()
let B = newSeqWith(n,scan())
var A = newBinaryIndexedTree[int](n+10)
var D = newBinaryIndexedTree[int](n+10)
for i in 1..<n:
  A.plus i+1, B[i] - B[i-1]
for i in 2..<n:
  if A[i] != A[i-1]: D.plus i, 1
q.times:
  let qtype = scan()
  # echo "---"
  if qtype == 1:
    let (l,r,x) = (scan(),scan(),scan())
    let dal = A[l-1] == A[l]
    let dar = A[r] == A[r+1]
    A.plus l,x
    A.plus r+1,-x
    let dal2 = A[l-1] == A[l]
    let dar2 = A[r] == A[r+1]
    if dal xor dal2:
      if dal : D.plus l,1
      else: D.plus l,-1
    if dar xor dar2:
      if dar : D.plus r+1,1
      else: D.plus r+1,-1
    # echo A
    # echo D
    # echo l," ",r," ",x
  else:
    let (l,r) = (scan(),scan())
    # echo A
    # echo D
    # echo l," ",r#," ",x
    echo D[r]-D[l]+1