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 
#include <bits/stdc++.h>
using namespace std;
struct seg {
  long long segno;
  long long start;
  long long end;
  long long diff;
} arr[1000];
bool compare(seg a, seg b) { return a.diff < b.diff; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n, q;
  cin >> n >> q;
  for (long long i = 0; i < n; ++i) {
    arr[i].segno = i + 1;
    cin >> arr[i].start >> arr[i].end;
    arr[i].diff = arr[i].end + 1 - arr[i].start;
  }
  long long shuffle = 10000;
  long long finalcount = INT_MAX;
  vector<long long> finalans;
  while (shuffle--) {
    random_shuffle(arr, arr + n);
    long long count = 0;
    vector<long long> notin;
    long long ans[1000] = {0};
    for (long long i = 0; i < n; ++i) {
      bool flag = 0;
      for (long long j = arr[i].start - 1; j < arr[i].end; ++j) {
        if (ans[j] + 1 > q) {
          flag = 1;
          break;
        }
      }
      if (flag == 0) {
        for (long long j = arr[i].start - 1; j < arr[i].end; ++j) {
          ans[j]++;
        }
      } else {
        count++;
        notin.push_back(arr[i].segno);
      }
    }
    sort(notin.begin(), notin.end());
    if (count < finalcount) {
      finalcount = count;
      finalans.clear();
      for (long long i = 0; i < notin.size(); ++i) {
        finalans.push_back(notin[i]);
      }
    }
  }
  cout << finalcount << endl;
  for (long long i = 0; i < finalans.size(); ++i) {
    cout << finalans[i] << " ";
  }
}
