#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii ;
typedef pair<ll, ll> pll ;
typedef vector<pii> vii ;
typedef vector<int> veci ;
typedef vector<pll> vll ;
typedef vector<ll> vecll;
// find_by_order order_of_key
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define Mp make_pair
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " = " << x << endl
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb lower_bound
#define ub upper_bound
#define for1(n) for(int i=1;i<=n;i++)
#define for0(n) for(int i=0;i<n;i++)
#define forn(n) for(int i=n;i>0;i--)
#define pq priority_queue <pii, vector<pii>, greater<pii>>
const ll mod = 1e9+7 ;// 998244353 ;// 1e9+9;
ll inf=1e18;
const int N=5e3+100,L=21,bs=701,NN=1e6;
int B[N],C[N],D[N],E[N],n,m,k,q,dp[N],pre[N],vis[N];
vector<int>g[N];
ll dist[N];
pair<pii,pii>A[N];
int eshterak(pii p1,pii p2){
int l1=p1.S,r1=p1.F,l2=p2.S,r2=p2.F;
if(l1>l2){
swap(l1,l2);
swap(r1,r2);
}
if(r1+1==l2)return 0;
if(r1<l2)return -1;
return r1-l2+1;
}
int main(){
fast_io
cin>>n>>m;
for1(m)cin>>A[i].S.F>>A[i].F.S>>A[i].F.F>>A[i].S.S;
sort(A+1,A+m+1);
for1(m)dist[i]=inf;
ll ans=inf;
for1(m){
if(A[i].F.S==1)
dist[i]=A[i].S.S;
else
dist[i]+=A[i].S.S;
// cout<<dist[i]<<endl;
for(int j=i+1;j<=m;j++)if(eshterak(A[i].F,A[j].F)>=abs(A[i].S.F-A[j].S.F))
dist[j]=min(dist[j],dist[i]);
if(A[i].F.F==n)ans=min(ans,dist[i]);
}
cout<<(ans==inf ? -1:ans)<<endl;
}
