#include<bits/stdc++.h>
#include <array>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;


void solve() {
	int n; cin >> n;
	int m; cin >> m;
	vector<pair<int, LL>> LC, RC;
	vector<vector<pair<int, LL>>> edges(100000);
	rep(i, m) {
		int l, r; LL c;
		cin >> l >> r >> c; l--; r--;
		LC.push_back({ l, c });
		RC.push_back({ r, c });
		edges[l].push_back({ r, c });
	}
	sort(LC.begin(), LC.end());
	sort(RC.begin(), RC.end());
	rep(i, LC.size() - 1) {
		edges[LC[i + 1].first].push_back({ LC[i].first, 0 });
	}
	auto ritr = LC.rbegin();
	for(int i = 1; i < n; i++) {
		edges[i].push_back({ i - 1, 0 });
	}

	vector<LL> dp(100000); rep(i, n) dp[i] = -1;
	priority_queue<pair<LL, int>> q;
	q.push({ 0, 0 });
	while (!q.empty()) {
		auto top = q.top(); q.pop();
		int p = top.second; LL d = -top.first;
		if (dp[p] != -1) continue;
		dp[p] = d;
		rep(i, edges[p].size()) {
			q.push({ -(d + edges[p][i].second), edges[p][i].first });
		}
	}

	cout << dp[n - 1] << endl;
}

int main() {

	solve();

	return 0;
}

### 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>
#include <array>
using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;


void solve() {
	int n; cin >> n;
	int m; cin >> m;
	vector<pair<int, LL>> LC, RC;
	vector<vector<pair<int, LL>>> edges(100000);
	rep(i, m) {
		int l, r; LL c;
		cin >> l >> r >> c; l--; r--;
		LC.push_back({ l, c });
		RC.push_back({ r, c });
		edges[l].push_back({ r, c });
	}
	sort(LC.begin(), LC.end());
	sort(RC.begin(), RC.end());
	rep(i, LC.size() - 1) {
		edges[LC[i + 1].first].push_back({ LC[i].first, 0 });
	}
	auto ritr = LC.rbegin();
	for(int i = 1; i < n; i++) {
		edges[i].push_back({ i - 1, 0 });
	}

	vector<LL> dp(100000); rep(i, n) dp[i] = -1;
	priority_queue<pair<LL, int>> q;
	q.push({ 0, 0 });
	while (!q.empty()) {
		auto top = q.top(); q.pop();
		int p = top.second; LL d = -top.first;
		if (dp[p] != -1) continue;
		dp[p] = d;
		rep(i, edges[p].size()) {
			q.push({ -(d + edges[p][i].second), edges[p][i].first });
		}
	}

	cout << dp[n - 1] << endl;
}

int main() {

	solve();

	return 0;
}

```