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 

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Task1249 {
    public static void main(String[] args) {
        Solution solver = new Solution();
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        solver.solve(1, in, out);
        out.close();
    }

    private static class Solution {
        static class Segment {
            int start, end, idx;

            public Segment(int start, int end, int idx) {
                this.start = start;
                this.end = end;
                this.idx = idx;
            }
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            PriorityQueue<Segment> pq = new PriorityQueue<>(Comparator.comparing(x -> -x.end));
            Segment[] a = new Segment[n];
            for (int i = 0; i < n; ++i) {
                a[i] = new Segment(in.nextInt(), in.nextInt(), i);
            }
            Arrays.sort(a, (x, y) -> {
                if (x.start == y.start) return y.end - x.end;
                return x.start - y.start;
            });
            List<Integer> res = new ArrayList<>();
            for (int i = 0; i < n; ++i) {
                final int curStart = a[i].start;
                pq.removeIf(s -> s.end < curStart);
                pq.add(a[i]);
                if (pq.size() > k) {
                    res.add(pq.poll().idx + 1);
                }
            }
            out.println(res.size());
            for (int i = 0; i < res.size(); ++i) {
                if (i > 0) out.print(" ");
                out.print(res.get(i));
            }
            out.println();
        }
    }

    private static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 23434);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }

}