#include <bits/stdc++.h>
using namespace std;
const int MAXN = static_cast<const int>(2e5 + 5);
const int MOD = static_cast<const int>(1e9 + 7);
const int INF = 0x3f3f3f3f;
vector<pair<int, int> > v[MAXN];
set<pair<int, int> > s;
vector<int> ans;
void init() {
  for (int i = 1; i <= 2e5; ++i) v[i].clear();
  s.clear();
  ans.clear();
}
int main() {
  init();
  int n, k;
  scanf("%d%d", &n, &k);
  int L, R;
  int mi = INF, ma = -INF;
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &L, &R);
    mi = min(mi, L);
    ma = max(ma, R);
    v[L].emplace_back(make_pair(R, i));
  }
  for (int i = mi; i <= ma; ++i) {
    while (!s.empty() and s.begin()->first < i) s.erase(s.begin());
    for (auto it : v[i]) s.insert(it);
    while (s.size() > k) {
      ans.emplace_back((--s.end())->second);
      s.erase(--s.end());
    }
  }
  int sz = ans.size();
  printf("%d\n", sz);
  for (int i = 0; i < sz; ++i) {
    if (i != 0) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
  return 0;
}

### Prompt

Your task is to create a cpp solution to the following problem:

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 MAXN = static_cast<const int>(2e5 + 5);
const int MOD = static_cast<const int>(1e9 + 7);
const int INF = 0x3f3f3f3f;
vector<pair<int, int> > v[MAXN];
set<pair<int, int> > s;
vector<int> ans;
void init() {
  for (int i = 1; i <= 2e5; ++i) v[i].clear();
  s.clear();
  ans.clear();
}
int main() {
  init();
  int n, k;
  scanf("%d%d", &n, &k);
  int L, R;
  int mi = INF, ma = -INF;
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d", &L, &R);
    mi = min(mi, L);
    ma = max(ma, R);
    v[L].emplace_back(make_pair(R, i));
  }
  for (int i = mi; i <= ma; ++i) {
    while (!s.empty() and s.begin()->first < i) s.erase(s.begin());
    for (auto it : v[i]) s.insert(it);
    while (s.size() > k) {
      ans.emplace_back((--s.end())->second);
      s.erase(--s.end());
    }
  }
  int sz = ans.size();
  printf("%d\n", sz);
  for (int i = 0; i < sz; ++i) {
    if (i != 0) printf(" ");
    printf("%d", ans[i]);
  }
  printf("\n");
  return 0;
}

```