#include <bits/stdc++.h>
using namespace std;
int a[205] = {0}, c[205] = {0}, u = 1;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int b[205][2] = {0};
  int i, min = 1000000, max = 0;
  for (i = 1; i <= n; i++) {
    scanf("%d%d", &b[i][0], &b[i][1]);
    if (min > b[i][0]) min = b[i][0];
    if (max < b[i][1]) max = b[i][1];
    for (int j = b[i][0]; j <= b[i][1]; j++) a[j]++;
  }
  int ans = 0;
  for (i = min; i <= max; i++) {
    if (a[i] > k)
      while (a[i] != k) {
        int delete_number, maxlength = 0;
        for (int j = 1; j <= n; j++) {
          if (i >= b[j][0] && i <= b[j][1]) {
            if (maxlength <= b[j][1] - i) {
              maxlength = b[j][1] - i;
              delete_number = j;
            }
          }
        }
        for (int j = i; j - i <= maxlength; j++) {
          a[j]--;
        }
        ans++;
        c[u] = delete_number;
        u++;
        b[delete_number][0] = b[delete_number][1] = -1;
      }
  }
  if (ans) {
    printf("%d\n", ans);
    for (i = 1; i < u; i++) printf("%d ", c[i]);
  } else
    printf("0\n");
  return 0;
}
