#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
struct seg {
  int s, e, num;
} a[maxn];
int ox[maxn];
bool used[maxn];
bool cmp(seg a, seg b) {
  if (a.e == b.e)
    return a.s > b.s;
  else
    return a.e > b.e;
}
int main() {
  ios::sync_with_stdio(false);
  memset(ox, 0, sizeof(ox));
  memset(used, 0, sizeof(used));
  int n, k;
  int mn = 0x3f3f3f3f, mx = -1;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].s >> a[i].e;
    if (a[i].s < mn) mn = a[i].s;
    if (a[i].e > mx) mx = a[i].e;
    a[i].num = i;
    for (int j = a[i].s; j <= a[i].e; j++) {
      ox[j]++;
    }
  }
  vector<int> ans;
  sort(a + 1, a + n + 1, cmp);
  for (int i = mn; i <= mx; i++) {
    if (ox[i] > k) {
      int cnt = ox[i] - k;
      for (int j = 1; j <= n; j++) {
        if (i >= a[j].s && i <= a[j].e && !used[j]) {
          for (int k = a[j].s; k <= a[j].e; k++) ox[k]--;
          ans.push_back(a[j].num);
          used[j] = true;
          cnt--;
        }
        if (cnt == 0) break;
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << ' ';
  }
  cout << '\n';
  return 0;
}

### Prompt

Create a solution in Cpp for 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 = 2e5 + 5;
struct seg {
  int s, e, num;
} a[maxn];
int ox[maxn];
bool used[maxn];
bool cmp(seg a, seg b) {
  if (a.e == b.e)
    return a.s > b.s;
  else
    return a.e > b.e;
}
int main() {
  ios::sync_with_stdio(false);
  memset(ox, 0, sizeof(ox));
  memset(used, 0, sizeof(used));
  int n, k;
  int mn = 0x3f3f3f3f, mx = -1;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].s >> a[i].e;
    if (a[i].s < mn) mn = a[i].s;
    if (a[i].e > mx) mx = a[i].e;
    a[i].num = i;
    for (int j = a[i].s; j <= a[i].e; j++) {
      ox[j]++;
    }
  }
  vector<int> ans;
  sort(a + 1, a + n + 1, cmp);
  for (int i = mn; i <= mx; i++) {
    if (ox[i] > k) {
      int cnt = ox[i] - k;
      for (int j = 1; j <= n; j++) {
        if (i >= a[j].s && i <= a[j].e && !used[j]) {
          for (int k = a[j].s; k <= a[j].e; k++) ox[k]--;
          ans.push_back(a[j].num);
          used[j] = true;
          cnt--;
        }
        if (cnt == 0) break;
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << ' ';
  }
  cout << '\n';
  return 0;
}

```