#include #include using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int op(int a, int b) { return a + b; } int e() { return 0; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, q; cin >> n >> q; vectora(n), b(n - 1), c(n - 1); rep(i, n)cin >> a[i]; rep(i, n - 1)b[i] = a[i + 1] - a[i]; rep(i, n - 1)if (0 != b[i])c[i] = 1; segtreeseg(c); while (q--) { int t; cin >> t; if (1 == t) { int l, r, x; cin >> l >> r >> x; l--, r--; if (0 != l) { b[l - 1] += x; seg.set(l - 1, !!b[l - 1]); } b[r] -= x; seg.set(r, !!b[r]); } else { int l, r; cin >> l >> r; l--, r--; auto get = seg.prod(l, r); cout << get + 1 << endl; } } return 0; }