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:
/* Code by detestmaths*/


import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        FastScanner in;
        PrintWriter out;
        try{
           in = new FastScanner("input.txt");
           out = new PrintWriter("output.txt");
        }catch(FileNotFoundException e){
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);
        }
       int n = in.nextInt();
        int k = in.nextInt();
        ArrayList<event>e = new ArrayList<>();
        int end[] = new int[n];
        for (int i = 0; i < n; i++) {
            int l = in.nextInt();
            int r = in.nextInt();
            end[i] = r;
            e.add(new event(l,0,i));
            e.add(new event(r,1,i));
        }
        TreeSet<Integer>t = new TreeSet<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer integer, Integer t1) {
              if(end[integer] != end[t1])return Integer.compare(end[integer],end[t1]);
              return Integer.compare(integer,t1);
            }
        });
        Collections.sort(e,new event_comp());
        boolean bad[] = new boolean[n];
        int cnt = 0;
        for(event ev : e){
            if(bad[ev.id])continue;
            if(ev.type == 0){
                t.add(ev.id);
                cnt++;
            }else{
                t.remove(ev.id);
                cnt--;
            }
            if(cnt > k){
                cnt--;
                int best = t.pollLast();
                bad[best] = true;
            }
        }
        ArrayList<Integer>ans = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            if(bad[i])ans.add(i+1);
        }
        out.println(ans.size());
        for(Integer answer : ans)out.print(answer + " ");
        out.close();
    }
}
class event{
    int x, type, id;

    public event(int x, int type, int id) {
        this.x = x;
        this.type = type;
        this.id = id;
    }
}
class event_comp implements Comparator<event>{

    @Override
    public int compare(event event, event t1) {
        if(event.x != t1.x)return Integer.compare(event.x,t1.x);
        return Integer.compare(event.type,t1.type);
    }
}
class FastScanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");

    public FastScanner(InputStream s) {
        br = new BufferedReader(new InputStreamReader(s));
    }

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

    public String next() throws IOException {
        if (!st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

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

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

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