#include<iostream>
#include<vector>
#include<cstdint>

struct segtree{
  std::vector<int> tree;

  segtree(int n) : tree(n * 2, 0) {}

  int size() const {return tree.size() / 2;}

  void set(int i, int x) {
    i += size();
    tree[i] = x;
    while (i != 1) {
      i /= 2;
      tree[i] = tree[i * 2] + tree[i * 2 + 1];
    }
  }

  int get(int l, int r) const {
    l += size();
    r += size();
    int ret = 0;
    while (l != r) {
      if (l % 2 != 0) {
        ret += tree[l];
        l += 1;
      }
      l /= 2;
      if (r % 2 != 0) {
        r -= 1;
        ret += tree[r];
      }
      r /= 2;
    }
    return ret;
  }
};

int main() {
  using i64 = std::int_fast64_t;

  int n, q;
  std::cin >> n >> q;
  std::vector<i64> d(n + 1);
  {
    i64 pre = 0;
    for (int i = 0; i != n; i += 1) {
      i64 a;
      std::cin >> a;
      d[i] = a - pre;
      pre = a;
    }
    d[n] = -pre;
  }
  segtree seg(n + 1);

  const auto set = [&](int i){
    seg.set(i, d[i] == 0 ? 0 : 1);
  };

  for (int i = 0; i != n + 1; i += 1) {
    set(i);
  }

  for (int i = 0; i != q; i += 1) {
    int c;
    std::cin >> c;
    switch (c) {
    case 1: {
      int l, r;
      i64 x;
      std::cin >> l >> r >> x;
      l -= 1;
      d[l] += x;
      d[r] -= x;
      set(l);
      set(r);
    } break;
    case 2: {
      int l, r;
      std::cin >> l >> r;
      l -= 1;
      std::cout << seg.get(l + 1, r) + 1 << "\n";
    } break;
    }
  }
}