human
Give me a Python program to find any suitable set of books or determine that it is impossible to find such a set given the following:
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.

Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they have to read some amount of books before all entertainments. Alice and Bob will read each book together to end this exercise faster.

There are n books in the family library. The i-th book is described by three integers: t_i — the amount of time Alice and Bob need to spend to read it, a_i (equals 1 if Alice likes the i-th book and 0 if not), and b_i (equals 1 if Bob likes the i-th book and 0 if not).

So they need to choose some books from the given n books in such a way that:

  * Alice likes at least k books from the chosen set and Bob likes at least k books from the chosen set.

  * the total reading time of these books is minimized (they are children and want to play and joy as soon a possible). 


The set they choose is the same for both Alice an Bob (it's shared between them) and they read all books together, so the total reading time is the sum of t_i over all books that are in the chosen set.

Your task is to help them and find any suitable set of books or determine that it is impossible to find such a set.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5).

The next n lines contain descriptions of books, one description per line: the i-th line contains three integers t_i, a_i and b_i (1 ≤ t_i ≤ 10^4, 0 ≤ a_i, b_i ≤ 1), where:

  * t_i — the amount of time required for reading the i-th book.

  * a_i equals 1 if Alice likes the i-th book and 0 otherwise.

  * b_i equals 1 if Bob likes the i-th book and 0 otherwise. 

Output

If there is no solution, print only one integer -1. Otherwise print one integer T — the minimum total reading time of the suitable set of books.

Examples

Input

8 4
7 1 1
2 1 1
4 0 1
8 1 1
1 0 1
1 1 1
1 0 1
3 0 0

Output

18

Input

5 2
6 0 0
9 0 0
1 0 1
2 1 1
5 1 0

Output

8

Input

5 3
3 0 0
2 1...
#   A
assistant
#Here is Python program to find any suitable set of books or determine that it is impossible to find such a set.
uthor: yumtam
#   Created at: 2020-09-18 10:23

from __future__ import division, print_function
_interactive = False

def main():
    n, k = [int(t) for t in input().split()]

    a10 = []
    a01 = []
    a11 = []
    ad = {(1, 0): a10, (0, 1): a01, (1, 1): a11}

    for _ in range(n):
        t, a, b = [int(t) for t in input().split()]
        if (a, b) in ad:
            ad[(a, b)].append(t)

    for ar in ad.values():
        ar.sort()

    n10, n01, n11 = len(a10), len(a01), len(a11)

    if n10 + n11 < k or n01 + n11 < k:
        print(-1)
        return

    both = min(n11, k)
    remain = k - both
    cur = sum(a11[:both] + a10[:remain] + a01[:remain])
    ans = cur
    while both > 0 and remain < min(n10, n01):
        cur -= a11[both-1]
        cur += a10[remain] + a01[remain]
        both -= 1
        remain += 1
        ans = min(ans, cur)

    print(ans)

# Constants
INF = float('inf')
MOD = 10**9+7

# Python3 equivalent names
import os, sys, itertools
if sys.version_info[0] < 3:
    input = raw_input
    range = xrange

    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip

# print-flush in interactive problems
if _interactive:
    flush = sys.stdout.flush
    def printf(*args, **kwargs):
        print(*args, **kwargs)
        flush()

# Debug print, only works on local machine
LOCAL = "LOCAL_" in os.environ
debug_print = (print) if LOCAL else (lambda *x, **y: None)

# Fast IO
if (not LOCAL) and (not _interactive):
    from io import BytesIO
    from atexit import register
    sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
    sys.stdout = BytesIO()
    register(lambda: os.write(1, sys.stdout.getvalue()))
    input = lambda: sys.stdin.readline().rstrip('\r\n')

# Some utility functions(Input, N-dimensional lists, ...)
def input_as_list():
    return [int(x) for x in input().split()]

def input_with_offset(o):
    return [int(x)+o for x in input().split()]

def input_as_matrix(n, m):
    return [input_as_list() for _ in range(n)]

def array_of(f, *dim):
   ...