#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 500;
const long long mod = 1e9 + 7;
const long long cmod = 998244353;
const long long inf = 1LL << 61;
const int M = 1e6 + 500;
const long long int ths = 1LL << 40;
const int NN = 5e3 + 6;
vector<long long int> open[N], close[N], ans;
set<pair<long long int, long long int> > cur;
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int l[n + 1], r[n + 1];
  long long int mx = 0;
  for (int i = 1; i <= n; i++) {
    cin >> l[i] >> r[i];
    mx = max(mx, r[i] + 1);
    open[l[i]].push_back(i);
    close[r[i] + 1].push_back(i);
  }
  for (int i = 1; i <= mx; i++) {
    for (int j = 0; j < open[i].size(); j++) {
      long long int it = open[i][j];
      cur.insert({r[it], it});
    }
    for (int j = 0; j < close[i].size(); j++) {
      long long int it = close[i][j];
      cur.erase({r[it], it});
    }
    while (cur.size() > k) {
      auto it = cur.end();
      it--;
      ans.push_back((*it).second);
      cur.erase(it);
    }
  }
  cout << ans.size() << '\n';
  for (auto it : ans) cout << it << ' ';
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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 N = 3e5 + 500;
const long long mod = 1e9 + 7;
const long long cmod = 998244353;
const long long inf = 1LL << 61;
const int M = 1e6 + 500;
const long long int ths = 1LL << 40;
const int NN = 5e3 + 6;
vector<long long int> open[N], close[N], ans;
set<pair<long long int, long long int> > cur;
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int l[n + 1], r[n + 1];
  long long int mx = 0;
  for (int i = 1; i <= n; i++) {
    cin >> l[i] >> r[i];
    mx = max(mx, r[i] + 1);
    open[l[i]].push_back(i);
    close[r[i] + 1].push_back(i);
  }
  for (int i = 1; i <= mx; i++) {
    for (int j = 0; j < open[i].size(); j++) {
      long long int it = open[i][j];
      cur.insert({r[it], it});
    }
    for (int j = 0; j < close[i].size(); j++) {
      long long int it = close[i][j];
      cur.erase({r[it], it});
    }
    while (cur.size() > k) {
      auto it = cur.end();
      it--;
      ans.push_back((*it).second);
      cur.erase(it);
    }
  }
  cout << ans.size() << '\n';
  for (auto it : ans) cout << it << ' ';
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}

```