class SegmentTreeAns():
    """一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
    update: i番目をvalに変更する
    get_sum: 区間[begin, end)の和を求める
    """
    def __init__(self, n):
        self.n = n
        self.size = 1
        while self.size < n:
            self.size *= 2
        self.node = [0] * (2*self.size - 1)

    def update(self, i, val):
        i += (self.size - 1)
        self.node[i] = val
        while i > 0:
            i = (i - 1) // 2
            self.node[i] = self.node[2*i + 1] + self.node[2*i + 2]

    def get_sum(self, begin, end):
        begin += (self.size - 1)
        end += (self.size - 1)
        s = 0
        while begin < end:
            if (end - 1) & 1:
                end -= 1
                s = s + self.node[end]
            if (begin - 1) & 1:
                s = s + self.node[begin]
                begin += 1
            begin = (begin - 1) // 2
            end = (end - 1) // 2
        return s


      
class SegmentTreeAdd():
    """区間加算、一点取得クエリをそれぞれO(logN)で答えるデータ構造を構築する
    add: 区間[begin, end)にaddを加える
    get_val: i番目の値を求める
    """
    def __init__(self, n):
        self.size = 1
        while self.size < n:
            self.size *= 2
        self.node = [0] * (2*self.size - 1)

    def add(self, begin, end, val):
        begin += (self.size - 1)
        end += (self.size - 1)
        while begin < end:
            if (end - 1) & 1:
                end -= 1
                self.node[end] += val
            if (begin - 1) & 1:
                self.node[begin] += val
                begin += 1
            begin = (begin - 1) // 2
            end = (end - 1) // 2

    def get_val(self, i):
        i += (self.size - 1)
        val = 0
        while i >= 0:
            val += self.node[i]
            i = (i - 1) // 2
        return val


n, q = map(int, input().split())
a = list(map(int, input().split()))

st = SegmentTreeAdd(n)
for i in range(n):
    st.add(i, i+1, a[i])

st_ans = SegmentTreeAns(n)
for i in range(n-1):
    if a[i] != a[i+1]:
        st_ans.update(i, 1)

for _ in range(q):
    li = list(map(int, input().split()))
    if li[0] == 1:
        j, l, r, val = li
        st.add(l-1, r, val)
        if l-1 != 0:
            if st.get_val(l-2) != st.get_val(l-1):
                st_ans.update(l-2, 1)
            else:
                st_ans.update(l-2, 0)
        if r != n:
            if st.get_val(r-1) != st.get_val(r):
                st_ans.update(r-1, 1)
            else:
                st_ans.update(r-1, 0)
    if li[0] == 2:
        j, l, r = li
        print(st_ans.get_sum(l-1, r-1) + 1)