#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
pair<pair<int, int>, int> node[maxn];
struct cmp {
  bool operator()(const pair<int, int> p1, const pair<int, int> p2) {
    return p1.first < p2.first;
  }
};
priority_queue<int, vector<int>, greater<int> > les;
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> gret;
vector<int> vi;
int num[maxn];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    node[i] = make_pair(make_pair(x, y), i);
  }
  sort(node, node + n);
  int now = 0;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    now += 1;
    les.push(node[i].first.second);
    gret.push(pair<int, int>(node[i].first.second, node[i].second));
    while (les.top() < node[i].first.first) {
      if (!num[les.top()])
        now--;
      else
        num[les.top()]--;
      les.pop();
    }
    if (now > k) {
      ans++;
      num[gret.top().first]++;
      vi.push_back(gret.top().second);
      gret.pop();
      now--;
    }
  }
  cout << ans << endl;
  sort(vi.begin(), vi.end());
  for (int i = 0; i < ans; i++) {
    cout << vi[i] + 1 << ' ';
  }
}
