import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Collections;
import java.util.ArrayList;
import java.io.InputStream;

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

    static class E1ReadingBooksEasyVersion {
        public void solve(int testNumber, FastReader s, PrintWriter out) {
            int n = s.nextInt();
            int k = s.nextInt();
            ArrayList<Long> alice = new ArrayList<>();
            ArrayList<Long> bob = new ArrayList<>();
            ArrayList<Long> both = new ArrayList<>();

            for (int i = 0; i < n; i++) {
                long time = s.nextLong();
                int a = s.nextInt();
                int b = s.nextInt();

                if (a == 1 && b == 1) {
                    both.add(time);
                } else if (a == 1) {
                    alice.add(time);
                } else if (b == 1) {
                    bob.add(time);
                }
            }

            Collections.sort(alice);
            Collections.sort(bob);
            Collections.sort(both);

            boolean poss = true;
            if (both.size() + bob.size() < k) {
                poss = false;
            }

            if (both.size() + alice.size() < k) {
                poss = false;
            }

            if (!poss) {
                out.println(-1);
                return;
            }

            if (both.size() == 0) {
                long ans = 0L;
                for (int i = 0; i < k; i++) {
                    ans += bob.get(i);
                    ans += alice.get(i);
                }
                out.println(ans);
                return;
            }

            int start = 0;
            if (k > bob.size()) {
                start = Math.max(start, k - bob.size());
            }

            if (k > alice.size()) {
                start = Math.max(start, k - alice.size());
            }

            long sumBoth = 0L;
            for (int i = 0; i < start; i++) {
                sumBoth += both.get(i);
            }

            long sumA = 0L;
            for (int i = 0; i < k - start; i++) {
                sumA += alice.get(i);
            }

            long sumB = 0L;
            for (int i = 0; i < k - start; i++) {
                sumB += bob.get(i);
            }

            long ans = sumBoth + sumA + sumB;
            int currA = k - start - 1;
            int currB = k - start - 1;
            int currBoth = start;
            for (int elements = start; elements <= both.size() && currA >= 0 && currB >= 0; elements++) {
                ans = Math.min(ans, sumBoth + sumA + sumB);
                sumA -= alice.get(currA);
                sumB -= bob.get(currB);
                if (currBoth < both.size()) {
                    sumBoth += both.get(currBoth);
                } else {
                    break;
                }
                currA--;
                currB--;
                currBoth++;
            }

            out.println(ans);
        }

    }

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

        public FastReader(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 nextInt() {
            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 long nextLong() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long 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);

        }

    }
}

