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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken()); int k = Integer.parseInt(st.nextToken());
        ArrayList<Segment> segments = new ArrayList<>();
        int[] count = new int[200001];
        for (int i=0; i<n; i++) {
            st = new StringTokenizer(br.readLine());
            segments.add(new Segment(Integer.parseInt(st.nextToken()), Integer.parseInt(st.nextToken()), i));
            for (int j=segments.get(segments.size()-1).getLeft(); j<=segments.get(segments.size()-1).getRight(); j++) {
                count[j]++;
            }
        }
        Collections.sort(segments, new java.util.Comparator<Segment>() {
            public int compare(Segment a, Segment b) {
                if (a.getRight()>b.getRight()) {
                    return -1;
                }
                if (a.getRight()<b.getRight()) {
                    return 1;
                }
                if (a.getLeft()<b.getLeft()) {
                    return -1;
                }
                if (a.getLeft()>b.getLeft()) {
                    return 1;
                }
                if (a.getIndex()<b.getIndex()) {
                    return -1;
                }
                return 1;
            }
        });
        ArrayList<Integer> done = new ArrayList<>();
        boolean[] marked = new boolean[n];
        for (int i=0; i<count.length; i++) {
            if (count[i]>k) {
//                System.out.println("i = " + i);
                int num = 0; int initial = count[i];
                for (int j=0; j<segments.size(); j++) {
                    if (!marked[j] && segments.get(j).getLeft()<=i && segments.get(j).getRight()>=i) {
                        marked[j] = true;
                        num++;
                        done.add(j);
//                        System.out.println("removed segment " + (segments[j][2]+1));
                        for (int l=segments.get(j).getLeft(); l<=segments.get(j).getRight(); l++) {
                            count[l]--;
                        }
                    }
                    if (num==initial-k) {
                        break;
                    }
                }

            }
        }
        System.out.println(done.size());
        for (int i=0; i<done.size(); i++) {
            System.out.print((segments.get(done.get(i)).getIndex()+1)+" ");
        }

    }
}

class Segment {

    private int left;
    private int right;
    private int index;

    public Segment(int left, int right, int index) {
        this.left = left;
        this.right = right;
        this.index = index;
    }

    public int getLeft() {
        return left;
    }

    public int getRight() {
        return right;
    }

    public int getIndex() {
        return index;
    }

}