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 
import javax.swing.event.TreeSelectionEvent;

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

public class Main {

    public static void main(String[] args) throws IOException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        // FastScanner in = new FastScanner("search.in");
        //PrintWriter out = new PrintWriter("search.out");
        int n = in.nextInt();
        int k = in.nextInt();
        point p[] = new point[2 * n];
        for (int i = 0; i < n; i++) {
            p[i*2] = new point(in.nextInt(),0,i);
            p[i*2+1] = new point(in.nextInt(),1,i);
        }
        Arrays.sort(p,new comp());
        ArrayList<govno>ans = new ArrayList<>();
        TreeSet<Integer>open = new TreeSet<>();
        TreeMap<Integer,Integer>betterToRemove = new TreeMap<>();
        int cnt = 0;
        for (int i = 0; i < 2 * n; i++) {
            if(p[i].type == 0){
                open.add(p[i].id);
                cnt++;
            }
            else{
                if(cnt > k){
                TreeSet<Integer>toPut = new TreeSet<>();
                toPut.addAll(open);
                TreeSet<Integer>assist = new TreeSet<>();
                assist.addAll(toPut);
                while (!assist.isEmpty()){
                    int next = assist.pollFirst();
                    betterToRemove.put(next,betterToRemove.getOrDefault(next,0) + 1);
                }
                ans.add(new govno(toPut,cnt - k));
            }
                open.remove(p[i].id);
                cnt--;

            }
        }
        if(cnt > k){
            TreeSet<Integer>toPut = new TreeSet<>();
            toPut.addAll(open);
            TreeSet<Integer>assist = new TreeSet<>();
            assist.addAll(toPut);
            while (!assist.isEmpty()){
                int next = assist.pollFirst();
                betterToRemove.put(next,betterToRemove.getOrDefault(next,0) + 1);
            }
            ans.add(new govno(toPut,cnt - k));
        }
        TreeSet<Integer>removed = new TreeSet<>();
        for (int i = 0; i < ans.size(); i++) {
           govno govno = ans.get(i);
           TreeSet<Integer>neww = new TreeSet<>(new Comparator<Integer>() {
               @Override
               public int compare(Integer integer, Integer t1) {
                  if((int)betterToRemove.get(integer) != betterToRemove.get(t1)) return -Integer.compare(betterToRemove.get(integer),betterToRemove.get(t1));
                  return Integer.compare(integer,t1);
               }
           });
           while (!govno.a.isEmpty())neww.add(govno.a.pollFirst());
            for (int j = 0; j < govno.cnt; j++) {
                removed.add(neww.pollFirst());
            }
        }
        out.println(removed.size());
        while (!removed.isEmpty())out.print(removed.pollFirst() + 1 + " ");
        out.close();
    }
}
class govno{
    TreeSet<Integer>a;
    int cnt;

    public govno(TreeSet<Integer> a, int cnt) {
        this.a = a;
        this.cnt = cnt;
    }
}
class point{
    int x,type,id;

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

    @Override
    public int compare(point point, point t1) {
        if(point.x != t1.x)return Integer.compare(point.x,t1.x);
        return Integer.compare(point.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());
    }
}