#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
  int N, K;
  cin >> N >> K;
  multiset<pair<int, int> > S;
  vector<pair<int, int> > Seg(N);
  vector<pair<int, pair<int, int> > > mp;
  for (int i = (int)(0); i < (int)(N); i++) {
    cin >> Seg[i].first >> Seg[i].second;
    mp.push_back(make_pair(Seg[i].first, make_pair(1, i)));
    mp.push_back(make_pair(Seg[i].second + 1, make_pair(-1, i)));
  }
  sort(mp.begin(), mp.end());
  vector<int> ans;
  for (int i = (int)(0); i < (int)(mp.size()); i++) {
    auto m = mp[i];
    int x = m.first;
    while (mp[i].first == x) {
      int flag = mp[i].second.first;
      int idx = mp[i].second.second;
      if (flag == 1) {
        S.insert(make_pair(Seg[idx].second, idx));
      } else {
        if (S.count(make_pair(Seg[idx].second, idx)))
          S.erase(make_pair(Seg[idx].second, idx));
      }
      i++;
    }
    i--;
    while (S.size() > K) {
      auto itr = S.end();
      itr--;
      ans.push_back(itr->second);
      S.erase(itr);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (int a : ans) cout << a + 1 << ' ';
  cout << endl;
  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;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
  int N, K;
  cin >> N >> K;
  multiset<pair<int, int> > S;
  vector<pair<int, int> > Seg(N);
  vector<pair<int, pair<int, int> > > mp;
  for (int i = (int)(0); i < (int)(N); i++) {
    cin >> Seg[i].first >> Seg[i].second;
    mp.push_back(make_pair(Seg[i].first, make_pair(1, i)));
    mp.push_back(make_pair(Seg[i].second + 1, make_pair(-1, i)));
  }
  sort(mp.begin(), mp.end());
  vector<int> ans;
  for (int i = (int)(0); i < (int)(mp.size()); i++) {
    auto m = mp[i];
    int x = m.first;
    while (mp[i].first == x) {
      int flag = mp[i].second.first;
      int idx = mp[i].second.second;
      if (flag == 1) {
        S.insert(make_pair(Seg[idx].second, idx));
      } else {
        if (S.count(make_pair(Seg[idx].second, idx)))
          S.erase(make_pair(Seg[idx].second, idx));
      }
      i++;
    }
    i--;
    while (S.size() > K) {
      auto itr = S.end();
      itr--;
      ans.push_back(itr->second);
      S.erase(itr);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (int a : ans) cout << a + 1 << ' ';
  cout << endl;
  return 0;
}

```