#include <bits/stdc++.h>
using namespace std;

struct Segt {
  vector<int> sum;
  vector<int> val;
  Segt(vector<int> a) {
    function<void(int, int, int)> build = [&](int t, int lb, int rb) {
      if (rb - lb == 1) {
        val[lb] = a[lb];
        sum[t] = val[lb] != 0;
        return;
      }
      int mb = lb + rb >> 1;
      build(t << 1, lb, mb);
      build(t << 1 | 1, mb, rb);
      sum[t] = sum[t << 1] + sum[t << 1 | 1];
    };
    sum.assign(a.size() << 2, 0);
    val.assign(a.size(), 0);
    build(1, 0, a.size());
  }
  void update(int t, int lb, int rb, int k, int v) {
    if (rb - lb == 1) {
      assert(lb == k);
      val[k] += v;
      sum[t] = val[k] != 0;
      return;
    }
    int mb = lb + rb >> 1;
    if (k < mb) update(t << 1, lb, mb, k, v);
    else update(t << 1 | 1, mb, rb, k, v);
    sum[t] = sum[t << 1] + sum[t << 1 | 1];
  }
  int query(int t, int lb, int rb, int ql, int qr) {
    if (qr <= lb || rb <= ql) return 0;
    if (ql <= lb && rb <= qr) return sum[t];
    int mb = lb + rb >> 1;
    return query(t << 1, lb, mb, ql, qr) + query(t << 1 | 1, mb, rb, ql, qr);
  }
};

int main() {
  ios::sync_with_stdio(false);

  int N, Q;
  cin >> N >> Q;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  vector<int> da(N + 1);
  for (int i = 0; i < N; ++i) {
    da[i] = A[i];
    if (i) da[i] -= A[i - 1];
  }

  Segt tree(da);
  for (int i = 0; i < Q; ++i) {
    int P;
    cin >> P;
    if (P == 1) {
      int L, R, X;
      cin >> L >> R >> X;
      --L;
      tree.update(1, 0, da.size(), L, X);
      tree.update(1, 0, da.size(), R, -X);
    } else {
      int L, R;
      cin >> L >> R;
      --L;
      int ans = 1 + tree.query(1, 0, da.size(), L + 1, R);
      cout << ans << "\n";
    }
  }

  return 0;
}