#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10;
long long n, pos[N], k, del[N];
bool take[N];
pair<long long, long long> dot[N];
vector<long long> ocur[N];
vector<long long> ans;
set<pair<long long, long long> > heap;
void In() {
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> dot[i].first >> dot[i].second;
    pos[dot[i].first]++;
    pos[dot[i].second + 1]--;
    ocur[dot[i].first].push_back(i);
    ocur[dot[i].second + 1].push_back(-i);
  }
  for (long long i = 1; i < N; i++) pos[i] += pos[i - 1];
}
void Solve() {
  long long cur = 0;
  for (long long i = 0; i < N; i++) {
    cur += del[i];
    for (long long v : ocur[i])
      if (v > 0)
        heap.insert({dot[v].second, v});
      else {
        auto it = heap.find({dot[-v].second, -v});
        if (it != heap.end()) heap.erase(it);
      }
    while (pos[i] - cur > k) {
      if (heap.empty()) break;
      long long vt = heap.rbegin()->second;
      heap.erase(prev(heap.end()));
      cur++;
      ans.push_back(vt);
      del[dot[vt].second + 1]--;
    }
  }
  cout << ans.size() << endl;
  for (long long i : ans) cout << i << ' ';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  In();
  Solve();
}

### Prompt

Please formulate 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 long long N = 2e5 + 10;
long long n, pos[N], k, del[N];
bool take[N];
pair<long long, long long> dot[N];
vector<long long> ocur[N];
vector<long long> ans;
set<pair<long long, long long> > heap;
void In() {
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> dot[i].first >> dot[i].second;
    pos[dot[i].first]++;
    pos[dot[i].second + 1]--;
    ocur[dot[i].first].push_back(i);
    ocur[dot[i].second + 1].push_back(-i);
  }
  for (long long i = 1; i < N; i++) pos[i] += pos[i - 1];
}
void Solve() {
  long long cur = 0;
  for (long long i = 0; i < N; i++) {
    cur += del[i];
    for (long long v : ocur[i])
      if (v > 0)
        heap.insert({dot[v].second, v});
      else {
        auto it = heap.find({dot[-v].second, -v});
        if (it != heap.end()) heap.erase(it);
      }
    while (pos[i] - cur > k) {
      if (heap.empty()) break;
      long long vt = heap.rbegin()->second;
      heap.erase(prev(heap.end()));
      cur++;
      ans.push_back(vt);
      del[dot[vt].second + 1]--;
    }
  }
  cout << ans.size() << endl;
  for (long long i : ans) cout << i << ' ';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  In();
  Solve();
}

```