#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
typedef pair<int,int>P;
typedef pair<P,int>P2;
#define F first
#define S second

struct RLQ{
  int n=(1<<17),data[(1<<18)];
  RLQ(){
    fill(data,data+(1<<18),1e17);
  }
  void update(int k,int x){
    k+=n-1;
    data[k]=x;
    while(k>0){
      k=(k-1)/2;
      data[k]=min(data[k*2+1],data[k*2+2]);
    }
  }
  int find(int a,int b,int k=0,int l=0,int r=(1<<17)){
    if(r<=a || b<=l)return 1e17;
    if(a<=l && r<=b)return data[k];
    int v1=find(a,b,k*2+1,l,(l+r)/2);
    int v2=find(a,b,k*2+2,(l+r)/2,r);
    return min(v1,v2);
  }
};

int n,m;

signed main(){
	RLQ R;
	vector<P2>v;
	cin>>n>>m;
	r(i,m){
		int a,b,c;
		cin>>a>>b>>c; a--; b--;
		v.push_back(P2(P(b,a),c));
	}
	sort(v.begin(),v.end());
	R.update(0,0);
	r(i,m){
		int l=v[i].F.S;
		int r=v[i].F.F;
		int c=v[i].S;
		int MIN = R.find(l,r)+c;
		int X=R.find(r,r+1);
		if(X>MIN){
			R.update(r,MIN);
		}
	}
	int A=R.find(n-1,n);
	if(A>1e16)cout<<-1<<endl;
	else cout<<A<<endl;
}

### Prompt

Generate 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>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
typedef pair<int,int>P;
typedef pair<P,int>P2;
#define F first
#define S second

struct RLQ{
  int n=(1<<17),data[(1<<18)];
  RLQ(){
    fill(data,data+(1<<18),1e17);
  }
  void update(int k,int x){
    k+=n-1;
    data[k]=x;
    while(k>0){
      k=(k-1)/2;
      data[k]=min(data[k*2+1],data[k*2+2]);
    }
  }
  int find(int a,int b,int k=0,int l=0,int r=(1<<17)){
    if(r<=a || b<=l)return 1e17;
    if(a<=l && r<=b)return data[k];
    int v1=find(a,b,k*2+1,l,(l+r)/2);
    int v2=find(a,b,k*2+2,(l+r)/2,r);
    return min(v1,v2);
  }
};

int n,m;

signed main(){
	RLQ R;
	vector<P2>v;
	cin>>n>>m;
	r(i,m){
		int a,b,c;
		cin>>a>>b>>c; a--; b--;
		v.push_back(P2(P(b,a),c));
	}
	sort(v.begin(),v.end());
	R.update(0,0);
	r(i,m){
		int l=v[i].F.S;
		int r=v[i].F.F;
		int c=v[i].S;
		int MIN = R.find(l,r)+c;
		int X=R.find(r,r+1);
		if(X>MIN){
			R.update(r,MIN);
		}
	}
	int A=R.find(n-1,n);
	if(A>1e16)cout<<-1<<endl;
	else cout<<A<<endl;
}

```