#include <bits/stdc++.h>
using namespace std;
template <class T, class T1>
inline int lower(const T& v, T1 x) {
  return lower_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T, class T1>
inline int upper(const T& v, T1 x) {
  return upper_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T>
inline T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
inline T pw(T a, T p, T M) {
  T result = 1;
  for (T sq = a; p; p >>= 1, sq = (sq * 1ll * sq) % M) {
    if (p & 1) {
      result = result * 1ll * sq % M;
    }
  }
  return result;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& a) {
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const vector<T1, T2>& a) {
  bool f = 0;
  os << "[";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "]";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const set<T1, T2>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "}";
  return os;
}
template <class T1, class T2, class T3>
ostream& operator<<(ostream& os, const map<T1, T2, T3>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x.first << ":" << x.second;
  }
  os << "}";
  return os;
}
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(30);
    cout << fixed;
  }
};
struct TaskE {
  static const int N = 1e5 + 10;
  int n, m;
  short a[N];
  void solve(istream& in, ostream& out) {
    in >> n >> m;
    for (int i = 0; i < n; i++) {
      in >> a[i];
    }
    for (int i = 0; i < m; i++) {
      int type, l, r, x;
      in >> type >> l >> r >> x;
      l--, r--;
      if (type == 1) {
        for (int i = l; i <= r; i++) {
          if (a[i] > x) {
            a[i] -= x;
          }
        }
      } else {
        int result = 0;
        for (int i = l; i <= r; i++) {
          result += (a[i] == x);
        }
        out << result << endl;
      }
    }
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cout.precision(30);
  cout << fixed;
  TaskE solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
