#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long double PI = 3.1415926535898;
const long long LLMAX = LLONG_MAX;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int num[203] = {0};
  int l[n + 1], r[n + 1];
  for (int i = 0; i < n; i++) {
    cin >> l[i] >> r[i];
    num[l[i]] += 1;
    num[r[i] + 1] -= 1;
  }
  for (int i = 1; i <= 201; i++) num[i] += num[i - 1];
  set<int> s;
  for (int i = 1; i < 201; i++) {
    while (num[i] > k) {
      int index = -1, end = 0;
      for (int j = 0; j < n; j++) {
        auto it = s.find(j + 1);
        if (it == s.end()) {
          if (l[j] <= i && r[j] >= i && r[j] > end) {
            index = j;
            end = r[j];
          }
        }
      }
      for (int j = l[index]; j <= r[index]; j++) num[j]--;
      s.insert(index + 1);
    }
  }
  cout << s.size() << "\n";
  auto it = s.begin();
  for (it; it != s.end(); it++) cout << *it << " ";
}
