# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase
 
BUFSIZE = 8192
 
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# ------------------- fast io --------------------

n,k=map(int,input().split())
total=0
alice=[]
bob=[]
both=[]
for j in range(n):
    t,a,b=map(int,input().split())
    if a==1 and b==1:
        both.append(t)
    elif a==1:
        alice.append(t)
    elif b==1:
        bob.append(t)
both.sort()
bob.sort()
alice.sort()
both.reverse()
bob.reverse()
alice.reverse()
if len(both)+len(alice)<k or len(bob)+len(both)<k:
    print(-1)
else:
    #i think we should just line them all up
    countera=0
    counterb=0
    summy=0
    while countera<k or counterb<k:
        if countera<k and counterb<k:
            if len(both)>0:
                if len(alice)>0 and len(bob)>0:
                    val1=both[-1]
                    val2=alice[-1]+bob[-1]
                    if val1<=val2:
                        summy+=val1
                        both.pop()
                    else:
                        summy+=val2
                        alice.pop()
                        bob.pop()
                else:
                    summy+=both.pop()
            else:
                summy+=alice.pop()+bob.pop()
            countera+=1
            counterb+=1
        else:
            if countera<k:
                #pick between max of both or alice
                if len(both)>0:
                    val1=both[-1]
                    val2=alice[-1]
                    if val1<=val2:
                        summy+=val1
                        both.pop()
                    else:
                        summy+=val2
                        alice.pop()
                else:
                    summy+=alice.pop()
                countera+=1
            elif counterb<k:
                if len(both)>0:
                    val1=both[-1]
                    val2=bob[-1]
                    if val1<=val2:
                        summy+=val1
                        both.pop()
                    else:
                        summy+=val2
                        bob.pop()
                else:
                    summy+=bob.pop()
                counterb+=1
    print(summy)