import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T sum = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    sum += bit[x];
  }
  return sum;
}


int N, Q;
long[] A;
int[] T, L, R;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      T = new int[Q];
      L = new int[Q];
      R = new int[Q];
      X = new long[Q];
      foreach (q; 0 .. Q) {
        T[q] = readInt();
        L[q] = readInt() - 1;
        R[q] = readInt() - 1;
        if (T[q] == 1) {
          X[q] = readLong();
        }
      }
      
      auto bit0 = new long[N + 1];
      auto bit1 = new long[N + 1];
      foreach (i; 0 .. N) {
        bit0.bAdd(i, +A[i]);
        bit0.bAdd(i + 1, -A[i]);
      }
      foreach (i; 0 .. N - 1) {
        if (A[i] != A[i + 1]) {
          bit1.bAdd(i, +1);
        }
      }
      foreach (q; 0 .. Q) {
        if (T[q] == 1) {
          void update(int i, int s) {
            const a0 = bit0.bSum(i + 1);
            const a1 = bit0.bSum(i + 2);
            if (a0 != a1) {
              bit1.bAdd(i, s);
            }
          }
          if (0 <= L[q] - 1) update(L[q] - 1, -1);
          if (R[q] + 1 < N) update(R[q], -1);
          bit0.bAdd(L[q], +X[q]);
          bit0.bAdd(R[q] + 1, -X[q]);
          if (0 <= L[q] - 1) update(L[q] - 1, +1);
          if (R[q] + 1 < N) update(R[q], +1);
        } else {
          const res = bit1.bSum(R[q]) - bit1.bSum(L[q]);
          writeln(res + 1);
        }
        debug {
          writeln(iota(N).map!(i => bit0.bSum(i + 1)), " ", iota(N).map!(i => bit1.bSum(i + 1) - bit1.bSum(i)));
        }
      }
    }
  } catch (EOFException e) {
  }
}