#include <bits/stdc++.h>
using namespace std;
struct seg {
  int left, right;
  bool is_removed;
};
int main() {
  int n, k;
  cin >> n >> k;
  unordered_map<int, vector<int>> points_storage;
  unordered_map<int, seg> segments;
  vector<pair<int, int>> segs;
  vector<int> points;
  for (int i = 1; i <= n; i++) {
    int l, r;
    cin >> l >> r;
    segments.insert({i, {l, r}});
    segs.emplace_back(r, i);
  }
  sort(segs.rbegin(), segs.rend());
  for (auto segment : segs) {
    int index = segment.second;
    int l = segments[index].left, r = segments[index].right;
    for (int j = l; j <= r; j++) {
      if (points_storage.count(j)) {
        points_storage[j].push_back(index);
      } else {
        vector<int> s;
        s.push_back(index);
        points_storage.insert({j, s});
      }
    }
  }
  for (const auto& c : points_storage) {
    if (c.second.size() > k) {
      points.push_back(c.first);
    }
  }
  sort(points.begin(), points.end());
  vector<int> removed_segments;
  for (int p : points) {
    int coverage = points_storage[p].size();
    for (int j = coverage - 1; j >= 0; j--) {
      int curr_segment = points_storage[p][j];
      if (segments[curr_segment].is_removed) {
        coverage--;
      }
    }
    int i = 0;
    while (coverage > k) {
      int curr_segment = points_storage[p][i];
      if (!segments[curr_segment].is_removed) {
        segments[curr_segment].is_removed = true;
        removed_segments.push_back(curr_segment);
        coverage--;
      }
      i++;
    }
  }
  cout << removed_segments.size() << endl;
  for (auto removed : removed_segments) {
    cout << removed << " ";
  }
  return 0;
}
