#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
struct seg {
  int s, e, num;
} a[maxn];
int ox[maxn];
bool used[maxn];
bool cmp(seg a, seg b) {
  if (a.e == b.e)
    return a.s > b.s;
  else
    return a.e > b.e;
}
int main() {
  ios::sync_with_stdio(false);
  memset(ox, 0, sizeof(ox));
  memset(used, 0, sizeof(used));
  int n, k;
  int mn = 0x3f3f3f3f, mx = -1;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].s >> a[i].e;
    if (a[i].s < mn) mn = a[i].s;
    if (a[i].e > mx) mx = a[i].e;
    a[i].num = i;
    for (int j = a[i].s; j <= a[i].e; j++) {
      ox[j]++;
    }
  }
  vector<int> ans;
  sort(a + 1, a + n + 1, cmp);
  for (int i = mn; i <= mx; i++) {
    if (ox[i] > k) {
      int cnt = ox[i] - k;
      for (int j = 1; j <= n; j++) {
        if (i >= a[j].s && i <= a[j].e && !used[j]) {
          for (int k = a[j].s; k <= a[j].e; k++) ox[k]--;
          ans.push_back(a[j].num);
          used[j] = true;
          cnt--;
        }
        if (cnt == 0) break;
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << ' ';
  }
  cout << '\n';
  return 0;
}
