#include <bits/stdc++.h>
const int maxn = 2e5 + 7;
using namespace std;
vector<pair<pair<int, int>, int> > seg;
vector<int> ans;
int ct[maxn];
struct cmp {
  bool operator()(const pair<pair<int, int>, int> a,
                  const pair<pair<int, int>, int> b) const {
    return a.first.second < b.first.second;
  }
};
void printV(vector<int> ans) {
  cout << ans.size() << endl;
  for (auto x : ans) cout << x << ' ';
  cout << endl;
}
int main() {
  int n, k, l, r;
  cin >> n >> k;
  memset(ct, 0, sizeof ct);
  for (int i = 1; i <= n; i++) {
    cin >> l >> r;
    seg.push_back({{l, r}, i});
    ct[l]++;
    ct[r + 1]--;
  }
  sort(seg.begin(), seg.end());
  priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> >,
                 cmp>
      Q;
  int cur = 0;
  for (int i = 1; i < maxn; i++) {
    ct[i] += ct[i - 1];
    while (seg[cur].first.first <= i && cur < n) Q.push(seg[cur++]);
    while (ct[i] > k) {
      ct[i]--;
      pair<pair<int, int>, int> curSeg = Q.top();
      ans.push_back(curSeg.second);
      ct[curSeg.first.second + 1]++;
      Q.pop();
    }
  }
  printV(ans);
  return 0;
}
