#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 3e5 + 5;
int a[maxn], b[maxn], c[maxn], d[maxn], dp[maxn][2], st[4 * maxn];
vector<int> val;
void update(int pos, int x){
int id = 1, l = 1, r = val.size();
while(l < r){
int mid = (l + r) / 2;
if(pos <= mid) id = id * 2, r = mid;
else id = id * 2 + 1, l = mid + 1;
}
st[id] = min(st[id], x);
while(id > 1){
id /= 2;
st[id] = min(st[id * 2], st[id * 2 | 1]);
}
}
int get(int id, int l, int r, int u, int v){
if(v < l || r < u) return 1e18;
if(u <= l && r <= v) return st[id];
int mid = (l + r) / 2;
return min(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i] >> b[i] >> c[i] >> d[i];
for(int i = 1; i <= n; i++) val.push_back(a[i]);
for(int i = 1; i <= n; i++) val.push_back(b[i]);
for(int i = 1; i <= n; i++) val.push_back(c[i]);
memset(dp, 0x3f, sizeof(dp));
sort(val.begin(), val.end());
val.erase(unique(val.begin(), val.end()), val.end());
for(int i = 1; i <= n; i++){
a[i] = lower_bound(val.begin(), val.end(), a[i]) - val.begin() + 1;
b[i] = lower_bound(val.begin(), val.end(), b[i]) - val.begin() + 1;
c[i] = lower_bound(val.begin(), val.end(), c[i]) - val.begin() + 1;
}
memset(st, 0x3f, sizeof(st));
for(int i = 1; i <= n; i++){
if(val[a[i] - 1] == 1) dp[i][0] = d[i];
dp[i][0] = min(dp[i][0], get(1, 1, val.size(), a[i], b[i]) + d[i]);
update(c[i], dp[i][0]);
}
memset(st, 0x3f, sizeof(st));
for(int i = 1; i <= n; i++){
if(val[b[i] - 1] == m) dp[i][1] = d[i];
dp[i][1] = min(dp[i][1], get(1, 1, val.size(), a[i], b[i]) + d[i]);
update(c[i], dp[i][1]);
}
int ans = 1e18;
for(int i = 1; i <= n; i++) ans = min(ans, dp[i][0] + dp[i][1] - d[i]);
cout << (ans == 1e18 ? -1 : ans);
}
