#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
struct Segment {
  int l, r, i;
  bool operator<(const Segment& o) const {
    if (l < o.l)
      return true;
    else if (l == o.l && r > o.r)
      return true;
    return false;
  }
};
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<Segment> a(n);
  for (int i = 0; i < (n); i++) cin >> a[i].l >> a[i].r, a[i].i = i + 1;
  sort(a.begin(), a.end());
  vi p(200002);
  for (int i = 0; i < (n); i++) p[a[i].l]++, p[a[i].r + 1]--;
  vi ans;
  map<int, vi> seg;
  int cur = 0, i = 0;
  for (int j = 0; j < ((int)p.size()); j++) {
    cur += p[j];
    while (i != n && a[i].l <= j) {
      seg[a[i].r + 1].push_back(a[i].i);
      i++;
    }
    while (cur > k) {
      auto take = seg.rbegin();
      p[take->first]++;
      ans.push_back(take->second.back());
      take->second.pop_back();
      if (take->second.empty()) seg.erase(take->first);
      cur--;
    }
  }
  cout << (int)ans.size() << '\n';
  for (int j : ans) cout << j << ' ';
  return 0;
}
