#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int i, j, k;
int n, m, q;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
map<long long, long long> mp[30];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
struct node {
  int l, r, p;
} a[210];
int ans[210];
int b[210];
int cmp(node x, node y) {
  if (x.r != y.r)
    return x.r < y.r;
  else
    return x.l < y.l;
}
int main() {
  cin >> n >> m;
  memset(a, 0, sizeof a);
  memset(b, 0, sizeof b);
  memset(ans, 0, sizeof ans);
  for (i = 1; i <= n; i++) {
    scanf("%d %d", &a[i - 1].l, &a[i - 1].r);
    a[i - 1].p = i;
  }
  sort(a, a + n, cmp);
  int cnt = 0;
  for (i = 0; i < n; i++) {
    for (j = a[i].l; j <= a[i].r; j++) {
      b[j]++;
      if (b[j] > m) {
        ans[cnt++] = a[i].p;
        break;
      }
    }
  }
  printf("%d\n", cnt);
  for (i = cnt - 1; i >= 0; i--) printf("%d ", ans[i]);
  cout << endl;
  return 0;
}

### Prompt

In CPP, your task is to solve 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 + 10;
int i, j, k;
int n, m, q;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
map<long long, long long> mp[30];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
struct node {
  int l, r, p;
} a[210];
int ans[210];
int b[210];
int cmp(node x, node y) {
  if (x.r != y.r)
    return x.r < y.r;
  else
    return x.l < y.l;
}
int main() {
  cin >> n >> m;
  memset(a, 0, sizeof a);
  memset(b, 0, sizeof b);
  memset(ans, 0, sizeof ans);
  for (i = 1; i <= n; i++) {
    scanf("%d %d", &a[i - 1].l, &a[i - 1].r);
    a[i - 1].p = i;
  }
  sort(a, a + n, cmp);
  int cnt = 0;
  for (i = 0; i < n; i++) {
    for (j = a[i].l; j <= a[i].r; j++) {
      b[j]++;
      if (b[j] > m) {
        ans[cnt++] = a[i].p;
        break;
      }
    }
  }
  printf("%d\n", cnt);
  for (i = cnt - 1; i >= 0; i--) printf("%d ", ans[i]);
  cout << endl;
  return 0;
}

```