#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
const int maxn = 200005;
struct node {
  long long r, l, id;
} e[maxn];
long long vis[maxn];
bool cmp(node x, node y) {
  if (x.l != y.l)
    return x.l > y.l;
  else
    return x.r < y.r;
}
long long a[maxn];
long long dns[maxn];
int main() {
  long long n, k;
  memset(a, 0, sizeof(a));
  memset(vis, 0, sizeof(vis));
  scanf("%lld%lld", &n, &k);
  long long f = 0, mi = maxn;
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", &e[i].r, &e[i].l);
    a[e[i].r]++;
    a[1 + e[i].l]--;
    e[i].id = i;
    mi = min(mi, e[i].r);
    f = max(f, e[i].l);
  }
  a[0] = 0;
  for (int i = mi + 1; i <= f; i++) {
    a[i] = a[i - 1] + a[i];
  }
  sort(e + 1, e + 1 + n, cmp);
  long long ans = 0;
  long long p = 1;
  for (int i = mi; i <= f; i++) {
    while (a[i] > k) {
      for (int j = 1; j <= n; j++) {
        if (vis[j]) continue;
        if (e[j].r <= i) {
          vis[j] = 1;
          dns[++ans] = e[j].id;
          for (int l = i; l <= e[j].l; l++) a[l]--;
          break;
        }
      }
    }
  }
  printf("%lld\n", ans);
  for (int i = 1; i <= ans; i++) {
    if (i != ans) printf("%lld ", dns[i]);
    if (i == ans) printf("%lld\n", dns[ans]);
  }
}

### Prompt

Your challenge is to write 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;
long long mod = 1e9 + 7;
const int maxn = 200005;
struct node {
  long long r, l, id;
} e[maxn];
long long vis[maxn];
bool cmp(node x, node y) {
  if (x.l != y.l)
    return x.l > y.l;
  else
    return x.r < y.r;
}
long long a[maxn];
long long dns[maxn];
int main() {
  long long n, k;
  memset(a, 0, sizeof(a));
  memset(vis, 0, sizeof(vis));
  scanf("%lld%lld", &n, &k);
  long long f = 0, mi = maxn;
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", &e[i].r, &e[i].l);
    a[e[i].r]++;
    a[1 + e[i].l]--;
    e[i].id = i;
    mi = min(mi, e[i].r);
    f = max(f, e[i].l);
  }
  a[0] = 0;
  for (int i = mi + 1; i <= f; i++) {
    a[i] = a[i - 1] + a[i];
  }
  sort(e + 1, e + 1 + n, cmp);
  long long ans = 0;
  long long p = 1;
  for (int i = mi; i <= f; i++) {
    while (a[i] > k) {
      for (int j = 1; j <= n; j++) {
        if (vis[j]) continue;
        if (e[j].r <= i) {
          vis[j] = 1;
          dns[++ans] = e[j].id;
          for (int l = i; l <= e[j].l; l++) a[l]--;
          break;
        }
      }
    }
  }
  printf("%lld\n", ans);
  for (int i = 1; i <= ans; i++) {
    if (i != ans) printf("%lld ", dns[i]);
    if (i == ans) printf("%lld\n", dns[ans]);
  }
}

```