#include <bits/stdc++.h>
using namespace std;
const int N = 400010;
struct Event {
  int x, type, ind;
  Event() {}
  Event(int x, int type, int ind) : x(x), type(type), ind(ind) {}
  bool operator<(const Event &other) const {
    return make_pair(x, type) < make_pair(other.x, other.type);
  }
};
int n, k;
int l[N], r[N];
Event a[N];
bool del[N];
set<pair<int, int> > q;
vector<int> res;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &l[i], &r[i]);
    a[2 * i - 1] = Event(l[i], 0, i);
    a[2 * i] = Event(r[i], 1, i);
  }
  sort(a + 1, a + 2 * n + 1);
  int cov = 0;
  int ans = 0;
  for (int i = 1; i <= n; i++) del[i] = false;
  for (int i = 1; i <= 2 * n; i++) {
    int j = a[i].ind;
    if (a[i].type == 0) {
      q.insert(make_pair(-r[j], j));
      cov++;
      if (cov > k) {
        cov--;
        ans++;
        int ind = (*q.begin()).second;
        del[ind] = true;
        res.push_back(ind);
        q.erase(q.begin());
      }
    } else if (!del[j]) {
      cov--;
      q.erase(make_pair(-r[j], j));
    }
  }
  printf("%d\n", ans);
  for (int x : res) printf("%d ", x);
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

The only difference between easy and hard versions is constraints.

You are given n segments on the coordinate axis OX. Segments can intersect, lie inside each other and even coincide. The i-th segment is [l_i; r_i] (l_i ≤ r_i) and it covers all integer points j such that l_i ≤ j ≤ r_i.

The integer point is called bad if it is covered by strictly more than k segments.

Your task is to remove the minimum number of segments so that there are no bad points at all.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 200) — the number of segments and the maximum number of segments by which each integer point can be covered.

The next n lines contain segments. The i-th line contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 200) — the endpoints of the i-th segment.

Output

In the first line print one integer m (0 ≤ m ≤ n) — the minimum number of segments you need to remove so that there are no bad points.

In the second line print m distinct integers p_1, p_2, ..., p_m (1 ≤ p_i ≤ n) — indices of segments you remove in any order. If there are multiple answers, you can print any of them.

Examples

Input


7 2
11 11
9 11
7 8
8 9
7 8
9 11
7 9


Output


3
1 4 7 


Input


5 1
29 30
30 30
29 29
28 30
30 30


Output


3
1 2 4 


Input


6 1
2 3
3 3
2 3
2 2
2 3
2 3


Output


4
1 3 5 6 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int N = 400010;
struct Event {
  int x, type, ind;
  Event() {}
  Event(int x, int type, int ind) : x(x), type(type), ind(ind) {}
  bool operator<(const Event &other) const {
    return make_pair(x, type) < make_pair(other.x, other.type);
  }
};
int n, k;
int l[N], r[N];
Event a[N];
bool del[N];
set<pair<int, int> > q;
vector<int> res;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &l[i], &r[i]);
    a[2 * i - 1] = Event(l[i], 0, i);
    a[2 * i] = Event(r[i], 1, i);
  }
  sort(a + 1, a + 2 * n + 1);
  int cov = 0;
  int ans = 0;
  for (int i = 1; i <= n; i++) del[i] = false;
  for (int i = 1; i <= 2 * n; i++) {
    int j = a[i].ind;
    if (a[i].type == 0) {
      q.insert(make_pair(-r[j], j));
      cov++;
      if (cov > k) {
        cov--;
        ans++;
        int ind = (*q.begin()).second;
        del[ind] = true;
        res.push_back(ind);
        q.erase(q.begin());
      }
    } else if (!del[j]) {
      cov--;
      q.erase(make_pair(-r[j], j));
    }
  }
  printf("%d\n", ans);
  for (int x : res) printf("%d ", x);
  return 0;
}

```