#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
const int tree_siz = 1024*512-1;
pair<ll,pll> min_[tree_siz+1];
ll oper[tree_siz+1];
void spych(int akt)
{
min_[akt*2].ff += oper[akt];
min_[akt*2+1].ff += oper[akt];
oper[akt*2] += oper[akt];
oper[akt*2+1] += oper[akt];
oper[akt] = 0;
}
void add_seg(int akt, int p1, int p2, int s1, int s2, ll x)
{
if(p2 < s1 || p1 > s2) return;
if(p1 >= s1 && p2 <= s2)
{
min_[akt].ff += x;
oper[akt] += x;
return;
}
spych(akt);
add_seg(akt*2,p1,(p1+p2)/2,s1,s2,x);
add_seg(akt*2+1,(p1+p2)/2+1,p2,s1,s2,x);
min_[akt].ff = min(min_[akt*2].ff,min_[akt*2+1].ff);
min_[akt].ss = min(min_[akt*2].ss,min_[akt*2+1].ss);
}
pll get_min(int akt, int p1, int p2)
{
//cout << akt << " " << p1 << " " << p2 << " " << min_[akt].ff << " min\n";
if(min_[akt].ff >= 1) return min_[akt].ss;
if(p1 == p2) return {1e9+1,-1};
spych(akt);
if(min_[akt*2+1].ff >= 1) return min(get_min(akt*2,p1,(p1+p2)/2),min_[akt*2+1].ss);
return get_min(akt*2+1,(p1+p2)/2+1,p2);
}
set<pll> pairs[200001];
void upd(int akt, int p1, int p2, int p, pll x)
{
if(p1 == p2)
{
min_[akt].ss = x;
return;
}
spych(akt);
if(p <= (p1+p2)/2) upd(akt*2,p1,(p1+p2)/2,p,x);
else upd(akt*2+1,(p1+p2)/2+1,p2,p,x);
min_[akt].ss = min(min_[akt*2].ss,min_[akt*2+1].ss);
}
void upd_poz(int p)
{
if(siz(pairs[p]) == 0) upd(1,0,tree_siz/2,p,(pll){(ll)1e9+1,-1});
else upd(1,0,tree_siz/2,p,*pairs[p].begin());
}
vl solve(vector<pll> v1, vector<pll> v2, int k)
{
swap(v1,v2);
map<int,int> mp;
forall(it,v1) mp[it.ss] = 1;
forall(it,v2) mp[it.ss] = 1;
int cur = 1;
forall(it,mp) mp[it.ff] = cur++;
sort(all(v1));
sort(all(v2));
forall(it,v1) it.ss = mp[it.ss];
forall(it,v2) it.ss = mp[it.ss];
rep(i,cur) pairs[i] = {};
rep(i,tree_siz+1)
{
oper[i] = 0;
min_[i] = {0,{1e9+1,-1}};
}
rep(i,siz(v2)) pairs[v2[i].ss].insert({v2[i].ff,i});
rep(i,cur) upd_poz(i);
vl ans = {0};
forall(it,v1)
{
add_seg(1,0,tree_siz/2,it.ss,tree_siz/2,1);
pii b = get_min(1,0,tree_siz/2);
if(b.ss == -1)
{
add_seg(1,0,tree_siz/2,it.ss,tree_siz/2,-1);
continue;
}
//cout << it.ff << " " << it.ss << " " << b.ff << " " << b.ss << " v1\n";
ans.pb(it.ff+v2[b.ss].ff);
pairs[v2[b.ss].ss].erase(b);
upd_poz(v2[b.ss].ss);
add_seg(1,0,tree_siz/2,v2[b.ss].ss,tree_siz/2,-1);
}
sort(all(ans));
ll cur_ans = 0;
rep(i,siz(ans))
{
cur_ans += ans[i];
ans[i] = cur_ans;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n,k;
cin >> n >> k;
vector<pll> v1,v2,v3,v4;
rep(i,n)
{
int t,x,y,c;
cin >> t >> x >> y >> c;
if(t == 1) v1.pb({c,x});
if(t == 2) v2.pb({c,x});
if(t == 3) v3.pb({c,y});
if(t == 4) v4.pb({c,y});
}
vl ans1 = solve(v1,v2,k);
vl ans2 = solve(v3,v4,k);
ll ans = 1e18;
rep(i,siz(ans1)) if(k-i >= 0 && k-i < siz(ans2)) ans = min(ans,ans1[i]+ans2[k-i]);
if(ans != 1e18) cout << ans << "\n";
else cout << "-1\n";
}
