#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, k;
struct seg {
  int l, r, id;
  bool operator<(const seg& a) const {
    if (r != a.r) return r < a.r;
    return l < a.l;
  }
} s[maxn];
int ma[maxn << 2], tag[maxn << 2];
void push_down(int x) {
  if (tag[x]) {
    ma[x << 1] += tag[x];
    tag[x << 1] += tag[x];
    ma[x << 1 | 1] += tag[x];
    tag[x << 1 | 1] += tag[x];
    tag[x] = 0;
  }
}
void update(int x, int l, int r, int L, int R, int d) {
  if (l == L && r == R) {
    ma[x] += d;
    tag[x] += d;
    return;
  }
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    update(x << 1, l, mid, L, R, d);
  else if (L > mid)
    update(x << 1 | 1, mid + 1, r, L, R, d);
  else {
    update(x << 1, l, mid, L, mid, d);
    update(x << 1 | 1, mid + 1, r, mid + 1, R, d);
  }
  ma[x] = max(ma[x << 1], ma[x << 1 | 1]);
}
int getmax(int x, int l, int r, int L, int R) {
  if (l == L && r == R) return ma[x];
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    return getmax(x << 1, l, mid, L, R);
  else if (L > mid)
    return getmax(x << 1 | 1, mid + 1, r, L, R);
  return max(getmax(x << 1, l, mid, L, mid),
             getmax(x << 1 | 1, mid + 1, r, mid + 1, R));
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", &s[i].l, &s[i].r), s[i].id = i;
  sort(s + 1, s + 1 + n);
  int l, r;
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    l = s[i].l;
    r = s[i].r;
    if (getmax(1, 1, 2e5, l, r) < k)
      update(1, 1, 2e5, l, r, 1);
    else
      ans.push_back(s[i].id);
  }
  printf("%d\n", (int)ans.size());
  for (int id : ans) printf("%d ", id);
  return 0;
}

### 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;
const int maxn = 2e5 + 5;
int n, k;
struct seg {
  int l, r, id;
  bool operator<(const seg& a) const {
    if (r != a.r) return r < a.r;
    return l < a.l;
  }
} s[maxn];
int ma[maxn << 2], tag[maxn << 2];
void push_down(int x) {
  if (tag[x]) {
    ma[x << 1] += tag[x];
    tag[x << 1] += tag[x];
    ma[x << 1 | 1] += tag[x];
    tag[x << 1 | 1] += tag[x];
    tag[x] = 0;
  }
}
void update(int x, int l, int r, int L, int R, int d) {
  if (l == L && r == R) {
    ma[x] += d;
    tag[x] += d;
    return;
  }
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    update(x << 1, l, mid, L, R, d);
  else if (L > mid)
    update(x << 1 | 1, mid + 1, r, L, R, d);
  else {
    update(x << 1, l, mid, L, mid, d);
    update(x << 1 | 1, mid + 1, r, mid + 1, R, d);
  }
  ma[x] = max(ma[x << 1], ma[x << 1 | 1]);
}
int getmax(int x, int l, int r, int L, int R) {
  if (l == L && r == R) return ma[x];
  push_down(x);
  int mid = (l + r) >> 1;
  if (R <= mid)
    return getmax(x << 1, l, mid, L, R);
  else if (L > mid)
    return getmax(x << 1 | 1, mid + 1, r, L, R);
  return max(getmax(x << 1, l, mid, L, mid),
             getmax(x << 1 | 1, mid + 1, r, mid + 1, R));
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d %d", &s[i].l, &s[i].r), s[i].id = i;
  sort(s + 1, s + 1 + n);
  int l, r;
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    l = s[i].l;
    r = s[i].r;
    if (getmax(1, 1, 2e5, l, r) < k)
      update(1, 1, 2e5, l, r, 1);
    else
      ans.push_back(s[i].id);
  }
  printf("%d\n", (int)ans.size());
  for (int id : ans) printf("%d ", id);
  return 0;
}

```