#include <bits/stdc++.h>
using namespace std;
int n, k;
pair<pair<int, int>, int> a[200010];
vector<int> in[200010];
vector<int> out[200010];
set<pair<int, int> > s;
vector<int> v;
void pr() {
  for (auto ite = s.begin(); ite != s.end(); ite++) {
    cout << ite->first << " " << ite->second << endl;
  }
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 1; i <= int(n); i++) {
    int x, y;
    cin >> x >> y;
    a[i] = make_pair(make_pair(x, y), i);
    in[x].push_back(i);
    out[y].push_back(i);
  }
  for (int now = 1; now <= 200010; now++) {
    for (int i = 0; i < int(in[now].size()); i++) {
      int id = in[now][i];
      s.insert(make_pair(a[id].first.second, id));
    }
    while (s.size() > k) {
      auto ite = s.end();
      ite--;
      v.push_back(ite->second);
      s.erase(ite);
    }
    for (int i = 0; i < int(out[now].size()); i++) {
      int id = out[now][i];
      if (s.count(make_pair(now, id))) s.erase(make_pair(now, id));
    }
  }
  cout << v.size() << endl;
  for (int i = 0; i < int(v.size()); i++) cout << v[i] << " ";
  cout << endl;
}

### Prompt

Create a solution in cpp for 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;
int n, k;
pair<pair<int, int>, int> a[200010];
vector<int> in[200010];
vector<int> out[200010];
set<pair<int, int> > s;
vector<int> v;
void pr() {
  for (auto ite = s.begin(); ite != s.end(); ite++) {
    cout << ite->first << " " << ite->second << endl;
  }
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 1; i <= int(n); i++) {
    int x, y;
    cin >> x >> y;
    a[i] = make_pair(make_pair(x, y), i);
    in[x].push_back(i);
    out[y].push_back(i);
  }
  for (int now = 1; now <= 200010; now++) {
    for (int i = 0; i < int(in[now].size()); i++) {
      int id = in[now][i];
      s.insert(make_pair(a[id].first.second, id));
    }
    while (s.size() > k) {
      auto ite = s.end();
      ite--;
      v.push_back(ite->second);
      s.erase(ite);
    }
    for (int i = 0; i < int(out[now].size()); i++) {
      int id = out[now][i];
      if (s.count(make_pair(now, id))) s.erase(make_pair(now, id));
    }
  }
  cout << v.size() << endl;
  for (int i = 0; i < int(v.size()); i++) cout << v[i] << " ";
  cout << endl;
}

```