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 Test {

    public static void main(String[] args) {
        FastReader scan = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        Task solver = new Task();
        int t = 1;
        while (t --> 0) solver.solve(1, scan, out);
        out.close();
    }

    static class Task {

        public void solve(int testNumber, FastReader scan, PrintWriter out) {
            int n = scan.nextInt(), k = scan.nextInt();
            ArrayList<Range> a = new ArrayList<>();
            ArrayList<Integer> ans = new ArrayList<>();
            int[] curr = new int[200];
            for(int i = 0; i < n; i++) {
                Range got = new Range(scan.nextInt()-1, scan.nextInt()-1, i+1);
                a.add(got);
                for(int j = got.l; j <= got.r; j++) curr[j]++;
            }
            while(!a.isEmpty()) {
                int index = -1;
                int best = 0;
                int need = -1, nn = 0;
                for(int i = 0; i < 200; i++) {
                    if(curr[i] > nn) {
                        nn = curr[i];
                        need = i;
                    }
                }
                for(int i = 0; i < a.size(); i++) {
                    int c = count(k, curr, a.get(i), need);
                    if(c > best) {
                        best = c;
                        index = i;
                    }
                }
                if(best == 0) break;
                ans.add(a.get(index).idx);
                for(int i = a.get(index).l; i <= a.get(index).r; i++) curr[i]--;
                a.remove(index);
            }
            out.println(ans.size());
            for(int i : ans) out.print(i + " ");
        }
        
        static int count(int k, int[] curr, Range rr, int need) {
            if(rr.l > need || rr.r < need) return 0;
            int res = 0;
            for(int j = rr.l; j <= rr.r; j++) if(curr[j] > k) res++;
            return res;
        }
        
        static class Range {
            int l, r;
            int idx;
            
            public Range(int a, int b, int c) {
                l = a;
                r = b;
                idx = c;
            }
        }
    }

    static void shuffle(int[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            int temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static void shuffle(long[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            long temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(new File(s)));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}