// Om Namah Shivaya
#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;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n,m; cin >> n >> m;
vector<array<ll,4>> a(n);
rep(i,n){
rep(j,4){
cin >> a[i][j];
}
}
vector<ll> b;
rep(i,n){
rep(j,3){
b.pb(a[i][j]);
}
}
b.pb(1);
b.pb(m);
sort(all(b));
b.resize(unique(all(b))-b.begin());
rep(i,n){
rep(j,3){
a[i][j] = lower_bound(all(b),a[i][j]) - b.begin();
}
}
ll siz = sz(b);
ll dp1[siz][siz], dp2[siz][siz];
memset(dp1,0x3f,sizeof dp1);
memset(dp2,0x3f,sizeof dp2);
dp1[0][siz-1] = 0;
rep(i,n){
auto [l,r,k,w] = a[i];
rep(x,siz){
rep(y,siz){
amin(dp2[x][y], dp1[x][y]);
ll x2 = x, y2 = y;
if(l <= x and x <= r) x2 = k;
if(l <= y and y <= r) y2 = k;
amin(dp2[x2][y2], dp1[x][y] + w);
}
}
rep(x,siz){
rep(y,siz){
dp1[x][y] = dp2[x][y];
dp2[x][y] = inf2;
}
}
}
ll ans = inf2;
rep(x,siz){
amin(ans,dp1[x][x]);
}
if(ans >= inf2) ans = -1;
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
