#include <bits/stdc++.h>

using namespace std;

const int INF = (int) 1e9;

struct flow {
  struct E {
    int to;
    int cap;
  };
  int n;
  vector<vector<int>> g;
  vector<E> edges;
  vector<int> level;
  vector<int> pos;
  void init(int nn) {
    n = nn;
    g.clear();
    edges.clear();
    level.clear();
    pos.clear();
    level.resize(n + 1);
    g.resize(n + 1);
    pos.resize(n + 1);
  }
  void add(int a, int b, int c) {
    g[a].push_back((int) edges.size());
    g[b].push_back((int) edges.size() + 1);
    edges.push_back({b, c});
    edges.push_back({a, 0});
  }
  int dfs(int a, int cap) {
    if (a == n || cap == 0) {
      return cap;
    }
    while (pos[a] < (int) g[a].size()) {
      int i = g[a][pos[a]++];
      int b = edges[i].to;
      int c = edges[i].cap;
      if (c == 0 || level[b] != level[a] + 1) {
        continue;
      }
      int x = dfs(b, min(cap, c));
      if (x == 0) {
        continue;
      }
      edges[i].cap -= x;
      edges[i ^ 1].cap += x;
      return x;
    }
    return 0;
  }
  int get() {
    int ret = 0;
    while (1) {
      level[1] = pos[1] = 0;
      for (int i = 2; i <= n; i++) {
        level[i] = -1;
        pos[i] = 0;
      }
      queue<int> q;
      q.push(1);
      while (!q.empty()) {
        int a = q.front();
        q.pop();
        for (auto &i : g[a]) {
          int b = edges[i].to;
          int c = edges[i].cap;
          if (c > 0 && level[b] == -1) {
            level[b] = 1 + level[a];
            q.push(b);
          }
        }
      }
      if (level[n] == -1) {
        break;
      }
      while (1) {
        int x = dfs(1, INF);
        if (x == 0) {
          break;
        }
        ret += x;
      }
    }
    return ret;
  }
};

flow f;
int n;
int m;
int mx;

void getmx(int v, int tl, int tr) {
  if (tl == tr) {
    mx = max(mx, v);
  } else {
    int tm = (tl + tr) / 2;
    getmx(2 * v, tl, tm);
    getmx(2 * v + 1, tm + 1, tr);
  }
}

void build(int v, int tl, int tr) {
  if (tl == tr) {
    f.add(1 + n + v, 1 + n + mx + 1, 1);
  } else {
    int tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
    f.add(1 + n + v, 1 + n + 2 * v, INF);
    f.add(1 + n + v, 1 + n + 2 * v + 1, INF);
  }
}

void add(int v, int tl, int tr, int l, int r) {
  if (tr < l || r < tl) {
    return;
  }
  if (l <= tl && tr <= r) {
    f.add();
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  getmx(1, 1, n);
  f.init(1 + n + mx + 1);
  int cnt = 0;
  for (int i = 1; i <= m; i++) {
    int tp;
    cin >> tp;
    if (tp == 1) {
      int l, r;
      cin >> l >> r;

    }
    if (tp == 2) {

    }
  }
}