#include <bits/stdc++.h>
using namespace std;
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  long long n, k;
  cin >> n >> k;
  vector<pair<pair<long long, long long>, bool> > v;
  for (long long i = (long long)0; i < (long long)n; i++) {
    long long l, r;
    cin >> l >> r;
    v.push_back(pair<pair<long long, long long>, bool>(
        pair<long long, long long>(l, r), true));
  }
  vector<long long> ans;
  for (long long l = (long long)0; l < (long long)201; l++) {
    vector<pair<long long, long long> > r;
    for (long long i = (long long)0; i < (long long)n; i++) {
      if (v[i].second && v[i].first.first <= l && l <= v[i].first.second) {
        r.push_back(pair<long long, long long>(v[i].first.second - l, i));
      }
    }
    if (r.size() < k) continue;
    sort(r.begin(), r.end());
    reverse(r.begin(), r.end());
    for (long long i = (long long)0; i < (long long)r.size() - k; i++) {
      v[r[i].second].second = false;
      ans.push_back(r[i].second + 1);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (long long i = (long long)0; i < (long long)ans.size(); i++) {
    cout << ans[i] << ' ';
  }
  cout << endl;
}

### Prompt

Develop a solution in cpp to the problem described below:

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 vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  long long n, k;
  cin >> n >> k;
  vector<pair<pair<long long, long long>, bool> > v;
  for (long long i = (long long)0; i < (long long)n; i++) {
    long long l, r;
    cin >> l >> r;
    v.push_back(pair<pair<long long, long long>, bool>(
        pair<long long, long long>(l, r), true));
  }
  vector<long long> ans;
  for (long long l = (long long)0; l < (long long)201; l++) {
    vector<pair<long long, long long> > r;
    for (long long i = (long long)0; i < (long long)n; i++) {
      if (v[i].second && v[i].first.first <= l && l <= v[i].first.second) {
        r.push_back(pair<long long, long long>(v[i].first.second - l, i));
      }
    }
    if (r.size() < k) continue;
    sort(r.begin(), r.end());
    reverse(r.begin(), r.end());
    for (long long i = (long long)0; i < (long long)r.size() - k; i++) {
      v[r[i].second].second = false;
      ans.push_back(r[i].second + 1);
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (long long i = (long long)0; i < (long long)ans.size(); i++) {
    cout << ans[i] << ' ';
  }
  cout << endl;
}

```