#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1 << 62;
const long long MOD = 1e9 + 7;
const int iINF = 1 << 30;
const double PI = 3.14159265359;
const int MAXP = 200005;
int n, k;
vector<pair<int, int> > intv;
vector<int> ent[MAXP];
vector<int> ext[MAXP];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  intv.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> intv[i].first >> intv[i].second;
    ent[intv[i].first].push_back(i);
    ext[intv[i].second + 1].push_back(i);
  }
  set<pair<int, int> > curr;
  vector<int> ans;
  for (int p = 1; p < MAXP; p++) {
    for (int i = 0; i < ext[p].size(); i++) {
      curr.erase({intv[ext[p][i]].second, ext[p][i]});
    }
    for (int i = 0; i < ent[p].size(); i++) {
      curr.insert({intv[ent[p][i]].second, ent[p][i]});
    }
    while (curr.size() > k) {
      auto it = curr.end();
      it--;
      ans.push_back((*it).second);
      curr.erase(it);
    }
  }
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " ";
  cout << "\n";
  return 0;
}
