#include <bits/stdc++.h>
using namespace std;
struct haha {
  int x, y;
} one[200010];
int n, k;
int x, y;
int L;
int top;
int ans[200010];
bool vis[200010];
int seq[200010];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> one[i].x >> one[i].y;
    seq[one[i].x]++;
    seq[one[i].y + 1]--;
    L = max(L, one[i].y);
  }
  int now = 0;
  for (int i = 1; i <= L; i++) {
    now += seq[i];
    if (now > k) {
      for (int j = 1; j <= now - k; j++) {
        int tmp = 0;
        for (int h = 1; h <= n; h++)
          if (one[h].x <= i && i <= one[h].y && !vis[h]) {
            if (one[tmp].y > one[h].y)
              continue;
            else
              tmp = h;
          }
        vis[tmp] = true;
        ans[++top] = tmp;
        seq[one[tmp].x]--;
        seq[one[tmp].y + 1]++;
      }
      now = k;
    }
  }
  cout << top << endl;
  sort(ans + 1, ans + 1 + top);
  for (int i = 1; i <= top; i++) cout << ans[i] << " ";
}
