#include <bits/stdc++.h>
using namespace std;
void start() {}
vector<pair<long long, long long>> v[200001];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m;
  cin >> n >> m;
  vector<long long> a;
  for (long long i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back({y, i + 1});
  }
  set<pair<long long, long long>> s;
  for (long long i = 1; i < 200001; i++) {
    for (long long j = 0; j < v[i].size(); j++) s.insert(v[i][j]);
    while (s.size() > 0 && (s.begin())->first < i) s.erase(s.begin());
    while (s.size() > m) {
      auto it = s.rbegin();
      a.push_back(it->second);
      s.erase(*it);
    }
  }
  cout << a.size() << endl;
  for (long long i = 0; i < a.size(); i++) cout << a[i] << ' ';
}

### Prompt

Please provide a Cpp coded solution 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;
void start() {}
vector<pair<long long, long long>> v[200001];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m;
  cin >> n >> m;
  vector<long long> a;
  for (long long i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back({y, i + 1});
  }
  set<pair<long long, long long>> s;
  for (long long i = 1; i < 200001; i++) {
    for (long long j = 0; j < v[i].size(); j++) s.insert(v[i][j]);
    while (s.size() > 0 && (s.begin())->first < i) s.erase(s.begin());
    while (s.size() > m) {
      auto it = s.rbegin();
      a.push_back(it->second);
      s.erase(*it);
    }
  }
  cout << a.size() << endl;
  for (long long i = 0; i < a.size(); i++) cout << a[i] << ' ';
}

```