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.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n, k;
        n = scanner.nextInt();
        k = scanner.nextInt();
        Segment[] segments = new Segment[n];
        for(int i = 0; i < n; i++){
            int a, b;
            a = scanner.nextInt();
            b = scanner.nextInt();
            segments[i] = new Segment(a, b);
        }
        int points[] = new int[201];
        int segmentCount[] = new int[n];
        for(int i = 0; i < n; i++){
            for(int j = segments[i].l; j <= segments[i].r; j++){
                points[j]++;
            }
        }

        ArrayList<Integer> deleted = new ArrayList<>();

        for(int i = 1; i <= 200; i++){
            while(points[i] > k){
                int maxR = Integer.MIN_VALUE;
                int index = -1;
                for(int j = 0; j < segments.length; j++){
                    if(i >= segments[j].l && i <= segments[j].r && segments[j].r > maxR){
                        maxR = segments[j].r;
                        index = j;
                    }
                }
                for(int p = segments[index].l; p <= segments[index].r; p++)
                    points[p]--;
                segments[index].l = segments[index].r = -1;
                deleted.add(index+1);
            }
        }

        System.out.println(deleted.size());
        for(Integer x : deleted)
            System.out.print(x + " ");


    }
}

class Segment{
    int l, r;
    Segment(int l, int r){
        this.l = l;
        this.r = r;
    }
}