#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 5LL;
const long long mod = 1e9 + 7LL;
void solve();
void ITO();
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ITO();
  long long t = 1;
  while (t--) solve();
  return 0;
}
const long long N = (2e5 + 10);
void solve() {
  long long n, k;
  cin >> n >> k;
  long long psum[N] = {};
  set<vector<long long>> s;
  set<vector<long long>> now;
  vector<long long> res;
  for (long long i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    psum[l]++;
    psum[r + 1]--;
    s.insert({l, r, i});
  }
  for (long long i = 1; i < N; i++) {
    psum[i] += psum[i - 1];
    while (!s.empty() and (*s.begin())[0] <= i) {
      now.insert({(*s.begin())[1], (*s.begin())[2]});
      s.erase(s.begin());
    }
    if (psum[i] <= k) continue;
    while (psum[i] > k) {
      long long r = (*now.rbegin())[0];
      res.push_back((*now.rbegin())[1] + 1);
      now.erase({r, res.back() - 1});
      psum[r + 1] += 1;
      psum[i]--;
    }
  }
  cout << res.size() << "\n";
  for (auto x : res) cout << x << " ";
  cout << "\n";
  return;
}
void ITO() {}
