#include <bits/stdc++.h>
using namespace std;
int main() {
  int k, n;
  cin >> n >> k;
  vector<pair<int, int>> pp;
  set<pair<int, int>> seg;
  vector<int> cnt(200042, 0), sub(200042, 0);
  vector<int> v, ans, gg[200042];
  vector<int> erased(n, 0);
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    pp.push_back((make_pair(x, y)));
    cnt[x]++;
    cnt[y + 1]--;
    gg[x].push_back(i + 1);
    gg[y + 1].push_back(-i - 1);
  }
  for (int i = 1; i < 200041; i++) cnt[i] += cnt[i - 1];
  int curr = 0;
  for (int i = 0; i < 200041; i++) {
    curr += sub[i];
    for (auto it : gg[i]) {
      if (it > 0) {
        seg.insert(make_pair(pp[it - 1].second, it - 1));
      } else {
        auto itr = seg.find(make_pair(pp[-it - 1].second, -it - 1));
        if (itr != seg.end()) seg.erase(itr);
      }
    }
    while (cnt[i] - curr > k) {
      int pos = seg.rbegin()->second;
      curr++;
      --sub[pp[pos].second + 1];
      seg.erase(prev(seg.end()));
      if (!erased[pos]) {
        erased[pos] = 1;
        ans.push_back(pos + 1);
      }
    }
  }
  cout << ans.size() << endl;
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}

### 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;
int main() {
  int k, n;
  cin >> n >> k;
  vector<pair<int, int>> pp;
  set<pair<int, int>> seg;
  vector<int> cnt(200042, 0), sub(200042, 0);
  vector<int> v, ans, gg[200042];
  vector<int> erased(n, 0);
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    pp.push_back((make_pair(x, y)));
    cnt[x]++;
    cnt[y + 1]--;
    gg[x].push_back(i + 1);
    gg[y + 1].push_back(-i - 1);
  }
  for (int i = 1; i < 200041; i++) cnt[i] += cnt[i - 1];
  int curr = 0;
  for (int i = 0; i < 200041; i++) {
    curr += sub[i];
    for (auto it : gg[i]) {
      if (it > 0) {
        seg.insert(make_pair(pp[it - 1].second, it - 1));
      } else {
        auto itr = seg.find(make_pair(pp[-it - 1].second, -it - 1));
        if (itr != seg.end()) seg.erase(itr);
      }
    }
    while (cnt[i] - curr > k) {
      int pos = seg.rbegin()->second;
      curr++;
      --sub[pp[pos].second + 1];
      seg.erase(prev(seg.end()));
      if (!erased[pos]) {
        erased[pos] = 1;
        ans.push_back(pos + 1);
      }
    }
  }
  cout << ans.size() << endl;
  sort(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  cout << endl;
}

```