#include <bits/stdc++.h>
using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, K;
  cin >> N >> K;
  vector<pair<int, int>> vec(N);
  for (int i = 0; i < N; ++i) {
    cin >> vec[i].first >> vec[i].second;
  }
  sort(vec.begin(), vec.end());
  vector<vector<int>> lis(K);
  for (auto [_, v] : vec) {
    for (int i = 0; i < K; ++i) {
      if (lis[i].empty() || lis[i].back() <= v) {
        lis[i].push_back(v);
        break;
      } else {
        auto it = upper_bound(lis[i].begin(), lis[i].end(), v);
        int t = *it;
        *it = v;
        v = t;
      }
    }
  }
  int res = 0;
  for (int i = 0; i < K; ++i) {
    res += lis[i].size();
  }
  cout << res << "\n";
  return 0;
}