#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
const int N = 1e5 + 5;
int a[N];
inline int read() {
  register int sum(0);
  register char x(getchar());
  while (x >= '0' && x <= '9') sum = sum * 10 + (x - '0'), x = getchar();
  return sum;
}
int main() {
  int n(read()), m(read() + 1);
  if (m > 80000) m = 80000;
  for (register int i = 1; i <= n; ++i) a[i] = read();
  while (--m) {
    int tp(read()), l(read()), r(read()), x(read()), qwq(r - 7);
    if (tp == 1) {
      int ys(l);
      for (; ys <= qwq; ys += 8) {
        a[ys] -= (a[ys] > x) ? x : 0;
        a[ys + 1] -= (a[ys + 1] > x) ? x : 0;
        a[ys + 2] -= (a[ys + 2] > x) ? x : 0;
        a[ys + 3] -= (a[ys + 3] > x) ? x : 0;
        a[ys + 4] -= (a[ys + 4] > x) ? x : 0;
        a[ys + 5] -= (a[ys + 5] > x) ? x : 0;
        a[ys + 6] -= (a[ys + 6] > x) ? x : 0;
        a[ys + 7] -= (a[ys + 7] > x) ? x : 0;
      }
      for (; ys <= r; ++ys) a[ys] -= (a[ys] > x) ? x : 0;
    } else {
      int ys(l), ans(0);
      for (; ys <= qwq; ys += 8)
        ans += (a[ys] == x) + (a[ys + 1] == x) + (a[ys + 2] == x) +
               (a[ys + 3] == x) + (a[ys + 4] == x) + (a[ys + 5] == x) +
               (a[ys + 6] == x) + (a[ys + 7] == x);
      for (; ys <= r; ++ys) ans += (a[ys] == x);
      if (!ans) putchar('0');
      while (ans) putchar((char)(ans % 10 + '0')), ans /= 10;
      putchar('\n');
    }
  }
  return 0;
}
