/*input 
5 3
3 0 0
2 1 0
3 1 0
5 0 1
3 0 1
 
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e16;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
ll pref[maxn],pref2[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,k;
    cin>>n>>k;
    vector<int> both,ff,ss;
    REP(i,n){
        int t,x,y;
        cin>>t>>x>>y;
        if(x and y) both.pb(t);
        if(x and !y) ff.pb(t);
        if(!x and y) ss.pb(t);
    }
    sort(ALL(both));
    sort(ALL(ff));
    sort(ALL(ss));
    ll sum=0;
    ll ans=INF64;
    REP1(i,sz(ff)) pref[i]=pref[i-1]+ff[i-1]; 
    REP1(i,sz(ss)) pref2[i]=pref2[i-1]+ss[i-1]; 
    if(sz(ff)>=k and sz(ss)>=k) MNTO(ans,pref[k]+pref2[k]);
    REP(i,sz(both)){
        sum+=both[i];
        if(i+1+min(sz(ss),sz(ff))<k) continue;
        MNTO(ans,pref[k-i-1]+pref2[k-i-1]+sum);
    }
    if(ans==INF64) cout<<-1;
    else cout<<ans;
}