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 exactly $m$ 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 exactly $m$ 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 $m$ 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 three integers $n$, $m$ and $k$ ($1 \le k \le m \le n \le 2 \cdot 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 \le t_i \le 10^4$, $0 \le a_i, b_i \le 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.

If the solution exists, print $T$ in the first line — the minimum total reading time of the suitable set of books. In the second line print $m$ distinct integers from $1$ to $n$ in any order — indices of books which are in the set you found.

If there are several answers, print any of them.


-----Examples-----
Input
6 3 1
6 0 0
11 1 0
9 0 1
21 1 1
10 1 0
8 0 1

Output
24
6 5 1 
Input
6 3 2
6 0 0
11 1 0
9 0 1
21 1 1
10 1 0
8 0 1

Output
39
4 6 5

Difficulty: interview

Starter code:

Solutions:
# input = raw_input
# range = xrange
import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0

seg = [0]*200000

def offset(x):
	return x + 100000
def encode(x, y):
	return x*200002 + y
def decode(x):
	return x//200002, x%200002

def upd(node, L, R, pos, val):
	while L < R:
		seg[node] += val
		seg[offset(node)] += val*pos
		if L+1 == R:
			break
 
		M = (L+R)//2
		node <<= 1
		if pos < M:
			R = M
		else:
			L = M
			node += 1

def query(node, L, R, k):
	ret = 0
	while L < R:
		if k == 0:
			return ret
		if seg[node] == k:
			return ret + seg[offset(node)]
		if L+1 == R:
			return ret + k*L

		M = (L+R)//2
		node <<= 1
		if seg[node] >= k:
			R = M
		else:
			ret += seg[offset(node)]
			k -= seg[node]
			L = M
			node += 1

	return ret

n, m, k = inp[ii:ii+3]; ii += 3
A, B, both, neither = [], [], [], []
for i in range(n):
	t, a, b = inp[ii:ii+3]; ii += 3
	if a == 0 and b == 0:
		neither.append(encode(t, i+1))
	if a == 1 and b == 0:
		A.append(encode(t, i+1))
	if a == 0 and b == 1:
		B.append(encode(t, i+1))
	if a == 1 and b == 1:
		both.append(encode(t, i+1))
	upd(1, 0, 10001, t, 1)

A.sort(); B.sort(); both.sort()
p1 = min(k, len(both))
p2 = k - p1
if 2*k - p1 > m or p2 > min(len(A), len(B)):
	print(-1)
	return

sum, ans, ch = 0, 2**31, p1
for i in range(p1):
	sum += both[i]//200002
	upd(1, 0, 10001, both[i]//200002, -1)
for i in range(p2):
	sum += A[i]//200002 + B[i]//200002
	upd(1, 0, 10001, A[i]//200002, -1)
	upd(1, 0, 10001, B[i]//200002, -1)


ans = query(1, 0, 10001, m-2*k+p1) + sum

while p1 > 0:
	if p2 == min(len(A), len(B)):
		break
	upd(1, 0, 10001, A[p2]//200002, -1); sum += A[p2]//200002
	upd(1, 0, 10001, B[p2]//200002, -1); sum += B[p2]//200002
	upd(1, 0, 10001, both[p1-1]//200002, 1); sum -= both[p1-1]//200002
	p2 += 1
	p1 -= 1
	if m - 2*k + p1 < 0:
		break
	Q = query(1, 0, 10001, m-2*k+p1)
	if ans > sum + Q:
		ans = sum + Q
		ch = p1

print(ans)
ind = [both[i]%200002 for i in range(ch)] + [A[i]%200002 for i in range(k-ch)] + [B[i]%200002 for i in range(k-ch)]
st = neither + [both[i] for i in range(ch, len(both))] + [A[i] for i in range(k-ch, len(A))] + [B[i] for i in range(k-ch, len(B))]
st.sort()
ind += [st[i]%200002 for i in range(m-2*k+ch)]
print (' '.join(str(x) for x in ind))

# input = raw_input
# range = xrange
import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0
 
seg = [0]*200000
 
def offset(x):
	return x + 100000
def encode(x, y):
	return x*200002 + y
def decode(x):
	return x//200002, x%200002
 
def upd(node, L, R, pos, val):
	while L < R:
		seg[node] += val
		seg[offset(node)] += val*pos
		if L+1 == R:
			break
 
		M = (L+R)//2
		node <<= 1
		if pos < M:
			R = M
		else:
			L = M
			node += 1
 
def query(node, L, R, k):
	ret = 0
	while L < R:
		if k == 0:
			return ret
		if seg[node] == k:
			return ret + seg[offset(node)]
		if L+1 == R:
			return ret + k*L
 
		M = (L+R)//2
		node <<= 1
		if seg[node] >= k:
			R = M
		else:
			ret += seg[offset(node)]
			k -= seg[node]
			L = M
			node += 1
 
	return ret
 
n, m, k = inp[ii:ii+3]; ii += 3
A, B, both, neither = [], [], [], []
for i in range(n):
	t, a, b = inp[ii:ii+3]; ii += 3
	if a == 0 and b == 0:
		neither.append(encode(t, i+1))
	if a == 1 and b == 0:
		A.append(encode(t, i+1))
	if a == 0 and b == 1:
		B.append(encode(t, i+1))
	if a == 1 and b == 1:
		both.append(encode(t, i+1))
	upd(1, 0, 10001, t, 1)
 
A.sort(); B.sort(); both.sort()
p1 = min(k, len(both))
p2 = k - p1
if 2*k - p1 > m or p2 > min(len(A), len(B)):
	print(-1)
	return
 
sum, ans, ch = 0, 2**31, p1
for i in range(p1):
	sum += both[i]//200002
	upd(1, 0, 10001, both[i]//200002, -1)
for i in range(p2):
	sum += A[i]//200002 + B[i]//200002
	upd(1, 0, 10001, A[i]//200002, -1)
	upd(1, 0, 10001, B[i]//200002, -1)
 
 
ans = query(1, 0, 10001, m-2*k+p1) + sum
 
while p1 > 0:
	if p2 == min(len(A), len(B)):
		break
	upd(1, 0, 10001, A[p2]//200002, -1); sum += A[p2]//200002
	upd(1, 0, 10001, B[p2]//200002, -1); sum += B[p2]//200002
	upd(1, 0, 10001, both[p1-1]//200002, 1); sum -= both[p1-1]//200002
	p2 += 1
	p1 -= 1
	if m - 2*k + p1 < 0:
		break
	Q = query(1, 0, 10001, m-2*k+p1)
	if ans > sum + Q:
		ans = sum + Q
		ch = p1
 
print(ans)
ind = [both[i]%200002 for i in range(ch)] + [A[i]%200002 for i in range(k-ch)] + [B[i]%200002 for i in range(k-ch)]
st = neither + [both[i] for i in range(ch, len(both))] + [A[i] for i in range(k-ch, len(A))] + [B[i] for i in range(k-ch, len(B))]
st.sort()
ind += [st[i]%200002 for i in range(m-2*k+ch)]
print(' '.join(str(x) for x in ind))