#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"YES\n":"NO\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }
struct SegTree {
int l, r;
ll mn;
SegTree *left, *right;
SegTree (int l, int r): l(l), r(r), mn(1e18), left(nullptr), right(nullptr) { }
SegTree (int l, int r, ll mn): l(l), r(r), mn(mn), left(nullptr), right(nullptr) { }
void check ( ) {
int m = (l+r)/2;
if (left == nullptr) left = new SegTree (l, m);
if (right == nullptr) right = new SegTree (m+1, r);
}
void update(int i, ll v) {
if (i>r || l>i) return;
if (i<=l && r<=i) {
mn = v;
return;
}
check();
left->update(i, v);
right->update(i, v);
mn = min(left->mn, right->mn);
}
ll query(int i, int j) {
if (i>r || l>j) return 1e18;
if (i<=l && r<=j) return mn;
check();
return min(left->query(i, j), right->query(i, j));
}
};
const int N = 1e5 + 7;
struct device { ll a, b, c, d; };
void test_case() {
ll n, m;
cin >> n >> m;
vector<device> a(n+1);
SegTree *dp1 = new SegTree(1, 1e9);
SegTree *dpn = new SegTree(1, 1e9);
ll ans = 1e18;
dp1->update(1, 0);
dpn->update(m, 0);
fore (i, 1, n+1) {
cin >> a[i].a >> a[i].b >> a[i].c >> a[i].d;
ll nv1 = dp1->query(a[i].a, a[i].b) + a[i].d;
ll nvn = dpn->query(a[i].a, a[i].b) + a[i].d;
ans = min(ans, nv1 + nvn - a[i].d);
if (dp1->query(a[i].c, a[i].c) > nv1) dp1->update(a[i].c, nv1);
if (dpn->query(a[i].c, a[i].c) > nvn) dpn->update(a[i].c, nvn);
}
cout << (ans == 1e18 ? -1 : ans) << '\n';
}
int main() {
int tt = 1;
// cin >> tt;
while(tt--) test_case();
}
