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 java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.AbstractCollection;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Mufaddal Naya
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        D1TooManySegmentsEasyVersion solver = new D1TooManySegmentsEasyVersion();
        solver.solve(1, in, out);
        out.close();
    }

    static class D1TooManySegmentsEasyVersion {
        public void solve(int testNumber, InputReader c, OutputWriter w) {
            int n = c.readInt(), k = c.readInt();
            point p[] = new point[n];
            int seg[] = new int[(int) 2e5 + 10];
            for (int i = 0; i < n; i++) {
                int u = c.readInt(), v = c.readInt();
                p[i] = new point(u, v, i);
                seg[u]++;
                seg[v + 1]--;
            }
            for (int i = 1; i < 2e5 + 10; i++) {
                seg[i] += seg[i - 1];
            }
            ArrayList<Integer> points = new ArrayList<>();
            for (int i = 0; i < 2e5 + 10; i++) {
                if (seg[i] > k) {
                    points.add(i);
                }
            }
            //w.printLine(points);
            int ptr = 0;
            Arrays.sort(p);
            PriorityQueue<ra> pq = new PriorityQueue<>();
            ArrayList<Integer> ans = new ArrayList<>();
            FenwickTree ft = new FenwickTree((int) 2e5 + 10);
            for (int i = 0; i < n; i++) {
                int po = points.get(ptr);
                if (p[i].x <= po && p[i].y >= po) {
                    pq.add(new ra(p[i].ind, p[i].y));
                    if (i == n - 1) {
                        long rem = seg[po] - ft.get(po) - k;
//                    w.printLine(ptr+" "+points.get(ptr)+" "+seg[points.get(ptr)]+" "+rem+" "+ft.get(points.get(ptr)));
                        while (rem > 0) {
                            ra r = pq.poll();
//                        w.printLine(r.ind);
                            ans.add(r.ind + 1);
                            //w.printLine(ft.get(7));
                            rem--;
                            ft.add(po, 1);
                            ft.add(r.l + 1, -1);
                        }
                        if (ptr >= points.size()) {
                            break;
                        }
                        int kl = po;
                        long que = ft.get(kl);
                        while (ptr < points.size() && seg[kl] - que <= k) {
                            ptr++;
                            if (ptr >= points.size()) {
                                break;
                            }
                            kl = points.get(ptr);
                            que = ft.get(kl);
                        }
                        if (ptr >= points.size()) {
                            break;
                        }
                    }
                } else {
                    long rem = seg[po] - ft.get(po) - k;
//                w.printLine(ptr+" "+points.get(ptr)+" "+seg[points.get(ptr)]+" "+rem+" "+ft.get(points.get(ptr)));
                    while (rem > 0) {
                        if (pq.isEmpty()) {
                            Collections.sort(ans);
                            w.printLine(ans.size());
                            for (int kl : ans) {
                                w.print(kl + " ");
                            }
                            w.printLine();
                            w.printLine(rem + " " + seg[po] + " " + ft.get(po));
                            w.printLine("Lag Gaye");
                            w.flush();
                            return;
                        }
                        ra r = pq.poll();
//                    w.printLine(r.ind);
                        ans.add(r.ind + 1);
                        //w.printLine(ft.get(7));
                        rem--;
                        ft.add(po, 1);
                        ft.add(r.l + 1, -1);
                    }
                    if (ptr >= points.size()) {
                        break;
                    }
                    int kl = po;
                    long que = ft.get(kl);
                    while (ptr < points.size() && seg[kl] - que <= k) {
                        ptr++;
                        if (ptr >= points.size()) {
                            break;
                        }
                        kl = points.get(ptr);
                        que = ft.get(kl);
                    }
                    if (ptr >= points.size()) {
                        break;
                    }
                    i--;
                }
            }
            Collections.sort(ans);
            w.printLine(ans.size());
            for (int kl : ans) {
                w.print(kl + " ");
            }
            w.printLine();
        }

    }

    static class point implements Comparable<point> {
        int x;
        int y;
        int ind;

        public point(int x, int y, int ind) {
            this.x = x;
            this.y = y;
            this.ind = ind;
        }

        public int compareTo(point o) {
            if (this.x == o.x) {
                return this.y - o.y;
            }
            return this.x - o.x;
        }

    }

    static class ra implements Comparable<ra> {
        int ind;
        int l;

        public ra(int ind, int l) {
            this.ind = ind;
            this.l = l;
        }

        public int compareTo(ra o) {
            return o.l - this.l;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class FenwickTree {
        private final long[] value;

        public FenwickTree(int size) {
            value = new long[size];
        }

        public long get(int to) {
            to = Math.min(to, value.length - 1);
            long result = 0;
            while (to >= 0) {
                result += value[to];
                to = (to & (to + 1)) - 1;
            }
            return result;
        }

        public void add(int at, long value) {
            while (at < this.value.length) {
                this.value[at] += value;
                at = at | (at + 1);
            }
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine() {
            writer.println();
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

        public void flush() {
            writer.flush();
        }

        public void printLine(int i) {
            writer.println(i);
        }

    }
}

