#include <bits/stdc++.h>
using namespace std;
void solve() {
  int i, j = 0, r = 200, q, k = 1, d, y = 0, h, flag = 1, n, m = 0,
         a = 1000000007, b = 1000000007, h1, h2, a1, b1, a2, w, x, u, f, l, c,
         z;
  cin >> n >> k;
  m = 100005;
  vector<pair<int, int> > v[m + 1];
  for (i = 1; i < n + 1; i++) {
    cin >> a >> b;
    v[a].push_back({b, i});
  }
  vector<int> vp;
  set<pair<int, int> > st;
  for (i = 1; i < m; i++) {
    for (auto it : v[i]) st.insert(it);
    while (!st.empty() and st.begin()->first < i) st.erase(st.begin());
    while (st.size() > k) {
      auto it2 = *st.rbegin();
      vp.push_back(it2.second);
      st.erase(it2);
    }
  }
  sort(vp.begin(), vp.end());
  cout << vp.size() << endl;
  for (i = 0; i < vp.size(); i++) cout << vp[i] << " ";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
}

### 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;
void solve() {
  int i, j = 0, r = 200, q, k = 1, d, y = 0, h, flag = 1, n, m = 0,
         a = 1000000007, b = 1000000007, h1, h2, a1, b1, a2, w, x, u, f, l, c,
         z;
  cin >> n >> k;
  m = 100005;
  vector<pair<int, int> > v[m + 1];
  for (i = 1; i < n + 1; i++) {
    cin >> a >> b;
    v[a].push_back({b, i});
  }
  vector<int> vp;
  set<pair<int, int> > st;
  for (i = 1; i < m; i++) {
    for (auto it : v[i]) st.insert(it);
    while (!st.empty() and st.begin()->first < i) st.erase(st.begin());
    while (st.size() > k) {
      auto it2 = *st.rbegin();
      vp.push_back(it2.second);
      st.erase(it2);
    }
  }
  sort(vp.begin(), vp.end());
  cout << vp.size() << endl;
  for (i = 0; i < vp.size(); i++) cout << vp[i] << " ";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
}

```