#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
T lowbit(T x) {
  return x & -x;
}
long long addmod(long long a, long long b, long long c) {
  return ((a + b) % c + c) % c;
}
long long powmod(long long a, long long b, long long c) {
  if (b == 0LL) return 1LL;
  long long ret = powmod(a, b >> 1, c);
  ret = ret * ret % c;
  if (b & 1LL) ret = ret * a % c;
  return ret;
}
long long modinv(long long a, long long b) { return powmod(a, b - 2LL, b); }
template <class T>
void maxe(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void mine(T &a, T b) {
  if (a > b) a = b;
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  T b = 1;
  char c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 7777;
const int M = 1111111;
const int K = 22;
int test;
int n, m, k, ans;
int nextl[M], nextr[M];
vector<pair<int, pair<int, int> > > v[N];
vector<int> s;
int have[M];
void init() {
  k = 0;
  for (int i = 1, j = 0; i < M; i++)
    if (i == (1 << k)) {
      nextl[i] = ++j;
      nextr[i] = ++j;
      k++;
    } else {
      nextl[i] = nextr[i] = ++j;
    }
}
int check(pair<int, int> a, pair<int, int> b) {
  return a.first <= b.second && b.first <= a.second;
}
int main() {
  init();
  scanf("%d%d", &n, &m);
  for (int ii = 1; ii <= m; ii++) {
    int t, level, l, r, x;
    scanf("%d%d", &t, &level);
    if (t == 1) {
      scanf("%d%d%d", &l, &r, &x);
      v[level].push_back(make_pair(x, make_pair(l, r)));
    } else {
      scanf("%d", &x);
      l = r = x;
      s.clear();
      for (int lv = level; lv <= n; lv++) {
        for (int i = 0; i < v[lv].size(); i++) {
          pair<int, pair<int, int> > cur = v[lv][i];
          if (!have[cur.first] && check(cur.second, make_pair(l, r))) {
            s.push_back(cur.first);
            have[cur.first] = 1;
          }
        }
        l = nextl[l];
        r = nextr[r];
      }
      ans = s.size();
      printf("%d\n", ans);
      for (int i = 0; i < ans; i++) have[s[i]] = 0;
    }
  }
  return 0;
}
