#include <bits/stdc++.h>
const int inf1 = 1e9;
const long long int inf2 = 1e18;
const int N = 100000;
using namespace std;
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int arr[2 * N + 10] = {0};
int solve() {
  int n, k;
  cin >> n >> k;
  map<pair<int, int>, int> mp, mp2;
  int ma = 0;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    mp[{a, i}] = b;
    mp2[{b, i}] = a;
    ma = max(ma, b);
  }
  auto itr = mp.begin();
  auto itr2 = mp2.begin();
  set<pair<int, int>> pq;
  int c = 0;
  set<int> s;
  for (int i = 1; i <= ma; i++) {
    while (itr != mp.end() && itr->first.first == i) {
      pq.insert({-itr->second, itr->first.second});
      itr++;
    }
    while (pq.size() > k) {
      int idx = pq.begin()->second;
      s.insert(idx + 1);
      pq.erase(pq.begin());
    }
    while (itr2 != mp2.end() && itr2->first.first == i) {
      pq.erase({-itr2->first.first, itr2->first.second});
      itr2++;
    }
  }
  cout << (int)s.size() << "\n";
  for (auto i : s) cout << i << " ";
  cout << "\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}

### Prompt

Please create a solution in cpp 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>
const int inf1 = 1e9;
const long long int inf2 = 1e18;
const int N = 100000;
using namespace std;
int dirs[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int arr[2 * N + 10] = {0};
int solve() {
  int n, k;
  cin >> n >> k;
  map<pair<int, int>, int> mp, mp2;
  int ma = 0;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    mp[{a, i}] = b;
    mp2[{b, i}] = a;
    ma = max(ma, b);
  }
  auto itr = mp.begin();
  auto itr2 = mp2.begin();
  set<pair<int, int>> pq;
  int c = 0;
  set<int> s;
  for (int i = 1; i <= ma; i++) {
    while (itr != mp.end() && itr->first.first == i) {
      pq.insert({-itr->second, itr->first.second});
      itr++;
    }
    while (pq.size() > k) {
      int idx = pq.begin()->second;
      s.insert(idx + 1);
      pq.erase(pq.begin());
    }
    while (itr2 != mp2.end() && itr2->first.first == i) {
      pq.erase({-itr2->first.first, itr2->first.second});
      itr2++;
    }
  }
  cout << (int)s.size() << "\n";
  for (auto i : s) cout << i << " ";
  cout << "\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}

```