#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T rd(T& x) {
  T f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (T)(c - '0');
  x *= f;
  return x;
}
long long rd() {
  long long x;
  rd(x);
  return x;
}
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
const int inf = 1 << 30;
const int N = 200005;
vector<pair<int, int> > v[N];
bool del[N];
int endd[N];
int main() {
  int n = rd();
  int k = rd();
  for (register int i = 1, iend = n; i <= iend; ++i) {
    int l = rd();
    int r = rd();
    v[l].push_back(make_pair(r, i));
  }
  priority_queue<pair<int, int> > q;
  for (register int i = 1, iend = 200000; i <= iend; ++i) {
    k += endd[i - 1];
    for (auto& j : v[i]) q.push(j), ++endd[j.first];
    while (q.size() > k) {
      auto x = q.top();
      q.pop();
      del[x.second] = 1;
      --endd[x.first];
    }
  }
  int tot = 0;
  for (register int i = 1, iend = n; i <= iend; ++i)
    if (del[i]) ++tot;
  printf("%d\n", tot);
  for (register int i = 1, iend = n; i <= iend; ++i)
    if (del[i]) printf("%d ", i);
  return 0;
}

### Prompt

Generate 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;
template <typename T>
inline T rd(T& x) {
  T f = 1;
  x = 0;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (T)(c - '0');
  x *= f;
  return x;
}
long long rd() {
  long long x;
  rd(x);
  return x;
}
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
const int inf = 1 << 30;
const int N = 200005;
vector<pair<int, int> > v[N];
bool del[N];
int endd[N];
int main() {
  int n = rd();
  int k = rd();
  for (register int i = 1, iend = n; i <= iend; ++i) {
    int l = rd();
    int r = rd();
    v[l].push_back(make_pair(r, i));
  }
  priority_queue<pair<int, int> > q;
  for (register int i = 1, iend = 200000; i <= iend; ++i) {
    k += endd[i - 1];
    for (auto& j : v[i]) q.push(j), ++endd[j.first];
    while (q.size() > k) {
      auto x = q.top();
      q.pop();
      del[x.second] = 1;
      --endd[x.first];
    }
  }
  int tot = 0;
  for (register int i = 1, iend = n; i <= iend; ++i)
    if (del[i]) ++tot;
  printf("%d\n", tot);
  for (register int i = 1, iend = n; i <= iend; ++i)
    if (del[i]) printf("%d ", i);
  return 0;
}

```