#include <bits/stdc++.h>
using namespace std;
set<pair<int, int> > s;
int k, n;
int sz[200005];
pair<pair<int, int>, int> p[200005];
int ans[200005];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1, l, r; i <= n; ++i) {
    scanf("%d%d", &l, &r);
    p[i].first = {l, r + 1};
    p[i].second = i;
  }
  sort(p + 1, p + n + 1);
  for (int i = 1, pos = 1; i <= 200000; ++i) {
    sz[i] += sz[i - 1];
    while (!s.empty()) {
      auto it = s.end();
      --it;
      if (it->first != i) break;
      s.erase(it);
    }
    while (pos <= n && p[pos].first.first == i) {
      s.insert({p[pos].first.second, p[pos].second});
      ++sz[i];
      --sz[p[pos].first.second];
      ++pos;
    }
    while (sz[i] > k) {
      auto it = s.end();
      --it;
      --sz[i];
      ans[it->second] = 1;
      ++sz[it->first];
      s.erase(it);
    }
  }
  int tm = 0;
  for (int i = 1; i <= n; ++i) tm += ans[i];
  printf("%d\n", tm);
  for (int i = 1; i <= n; ++i) {
    if (ans[i]) {
      --tm;
      printf("%d%c", i, " \n"[tm == 0]);
    }
  }
  return 0;
}
