#include <bits/stdc++.h>
typedef long long ll;
#define  rep(i,a,b)for(long long i=a;i<b;++i)
#define  rrep(i,a,b)for(int i=a;i>=b;--i)
#define  yesno(flag)if(flag)cout<<"Yes"<<endl; else cout<<"No"<<endl;
using namespace std;
const ll INF=100000000000000LL;
const ll r197=1000000007;
typedef pair<ll,ll>P;
typedef pair<int,P>Pa;
bool Inframe(int a,int b,int c,int d,int h,int w){
	if(a+b>=0&&a+b<h&&c+d>=0&&c+d<w)return true;
	return false;
}
vector<P> v[100001];
int n,m;
ll ans=1;
ll C[100005]={-1};
string s;
multiset<ll> lset,rset;
ll a[100005];
ll b[100005]={};

int main() {
	cin>>n>>m;
	ll l,r,c;
	rep(i,0,m){
		cin>>l>>r>>c;
		v[r-1].push_back(P(l-1,c));
	}
	rep(i,0,n+1)C[i]=INF;
	C[0]=0;
	rep(i,1,n){
		ll res=INF;
		rep(j,0,v[i].size()){
			res=min(res,C[v[i][j].first]+v[i][j].second);
		}
		C[i]=res;
		for(int j=i-1;j>=0;--j){
			if(C[j]<=res)break;
			C[j]=res;
		}
	}
	if(C[n-1]==INF)cout<<-1<<endl;
	else cout<<C[n-1]<<endl;
	return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

We have N points numbered 1 to N arranged in a line in this order.

Takahashi decides to make an undirected graph, using these points as the vertices. In the beginning, the graph has no edge. Takahashi will do M operations to add edges in this graph. The i-th operation is as follows:

* The operation uses integers L_i and R_i between 1 and N (inclusive), and a positive integer C_i. For every pair of integers (s, t) such that L_i \leq s < t \leq R_i, add an edge of length C_i between Vertex s and Vertex t.



The integers L_1, ..., L_M, R_1, ..., R_M, C_1, ..., C_M are all given as input.

Takahashi wants to solve the shortest path problem in the final graph obtained. Find the length of the shortest path from Vertex 1 to Vertex N in the final graph.

Constraints

* 2 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq L_i < R_i \leq N
* 1 \leq C_i \leq 10^9

Input

Input is given from Standard Input in the following format:


N M
L_1 R_1 C_1
:
L_M R_M C_M


Output

Print the length of the shortest path from Vertex 1 to Vertex N in the final graph. If there is no shortest path, print `-1` instead.

Examples

Input

4 3
1 3 2
2 4 3
1 4 6


Output

5


Input

4 2
1 2 1
3 4 2


Output

-1


Input

10 7
1 5 18
3 4 8
1 3 5
4 7 10
5 9 8
6 10 5
8 10 3


Output

28

### Response

```cpp
#include <bits/stdc++.h>
typedef long long ll;
#define  rep(i,a,b)for(long long i=a;i<b;++i)
#define  rrep(i,a,b)for(int i=a;i>=b;--i)
#define  yesno(flag)if(flag)cout<<"Yes"<<endl; else cout<<"No"<<endl;
using namespace std;
const ll INF=100000000000000LL;
const ll r197=1000000007;
typedef pair<ll,ll>P;
typedef pair<int,P>Pa;
bool Inframe(int a,int b,int c,int d,int h,int w){
	if(a+b>=0&&a+b<h&&c+d>=0&&c+d<w)return true;
	return false;
}
vector<P> v[100001];
int n,m;
ll ans=1;
ll C[100005]={-1};
string s;
multiset<ll> lset,rset;
ll a[100005];
ll b[100005]={};

int main() {
	cin>>n>>m;
	ll l,r,c;
	rep(i,0,m){
		cin>>l>>r>>c;
		v[r-1].push_back(P(l-1,c));
	}
	rep(i,0,n+1)C[i]=INF;
	C[0]=0;
	rep(i,1,n){
		ll res=INF;
		rep(j,0,v[i].size()){
			res=min(res,C[v[i][j].first]+v[i][j].second);
		}
		C[i]=res;
		for(int j=i-1;j>=0;--j){
			if(C[j]<=res)break;
			C[j]=res;
		}
	}
	if(C[n-1]==INF)cout<<-1<<endl;
	else cout<<C[n-1]<<endl;
	return 0;
}

```