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 seg {
    public static void main(String s[]) throws Exception {
        int len =(int)1e5;
        len*=2;
        Reader r = new Reader();
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = r.nextInt();
        int k=r.nextInt();
        int ml=0;
        pair[] inp=new pair[n];
        for(int i=0;i<n;i++){
            int a=r.nextInt()-1;
            int b=r.nextInt()-1;
            inp[i]=new pair(a,b);
            ml=Math.max(ml,b);
        }
        int px[]=new int[ml+2];
        ArrayList<Integer> app[]=new ArrayList[ml+2];
        for(int i=0;i<=ml+1;i++)
            app[i]=new ArrayList<Integer>();
        int co=1;
        for(pair i:inp){
            px[i.a]++;
            px[i.b+1]--;
            app[i.a].add(co);
            app[i.b+1].add((-1*co));
            co++;
        }
        SortedMap<Integer,TreeSet<Integer>> freq=new TreeMap<Integer, TreeSet<Integer>>();
        int sum=0;
        int del=0;
        int de[]=new int[ml+2];
        ArrayList<Integer> res=new ArrayList<Integer>();
        for(int i=0;i<=ml;i++){
            sum+=px[i];
            del+=de[i];
            //sum-=del;
            for(int j:app[i]) {
                int jj = Math.abs(j);
                if(j>0){
                    int last=inp[j-1].b+1;
                    TreeSet<Integer>  tr=freq.get(last);
                    if(tr==null)
                    {
                        tr=new TreeSet<Integer>();
                        tr.add(j);
                        freq.put(last,tr);

                    }
                    else
                    tr.add(j);
                }
                else {
                    TreeSet<Integer> tr=freq.get(i);
                    if(tr!=null)
                    {tr.remove(jj);
                    if(tr.size()==0)
                        freq.remove(i);}
                }
            }

            while (sum-del>k){
                //sum--;
                int key=freq.lastKey();
                TreeSet<Integer> val=freq.get(key);
                if(val.size()==1){
                    res.addAll(val);
                    freq.remove(key);
                }
                else {
                    int a=val.first();
                    res.add(a);
                    val.remove(a);
                }
                del++;
                //de[inp[a-1].b]++;
                de[key]--;
            }
        }
        StringBuffer sb=new StringBuffer();
        int size=0;
        for(int i:res){
            size++;
            sb.append(i+" ");
        }
        System.out.println(size);
        if(size!=0)
            System.out.println(sb);
    }


    static class pair{
        int a,b;

        public pair(int a, int b) {
            this.a = a;
            this.b = b;
        }
    }
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }
}