R=range
J=lambda:map(int,input().split())
N,*_=J()
A=[[[]for i in R(N+1)]for s in R(2)]
a=0
for _ in R(N):
	C,X,Y=J()
	if X<Y:a+=X;A[0][N-C]+=[X-Y]
	else:a+=Y;A[1][C]+=[Y-X]
import heapq
for t in A:
	s=[]
	for c in R(N):
		for x in t[c]:heapq.heappush(s,x)
		if s:a-=heapq.heappop(s)
print(a)