#include <bits/stdc++.h>
#define Int int64_t

using namespace std;

template <typename T>
struct edge {
	int to;
	T cost;
	edge(int t, T c) : to(t), cost(c) {}
};
template <typename T>
void dijkstra(const vector<vector< edge<T> >>& G, vector<T>& d, int s) {
	priority_queue<pair<T, int>, vector< pair<T, int> >, greater< pair<T, int> >> que;
	d[s] = 0;
	que.emplace(0, s);

	while (!que.empty()) {
		auto p = que.top();
		que.pop();
		int u = p.second;
		if (d[u] < p.first) { continue; }

		for (auto e : G[u]) {
			if (d[e.to] <= d[u] + e.cost) { continue; }
			d[e.to] = d[u] + e.cost;
			que.emplace(d[e.to], e.to);
		}
	}
}

int main() {
	const Int INF = 1e18;
	int N, M;
	cin >> N >> M;
	vector<vector< edge<Int> >> g(N);
	for (int i = 1; i < N; ++i) {
		g[i].emplace_back(i - 1, 0);
	}
	for (int i = 0; i < M; ++i) {
		int L, R, C;
		cin >> L >> R >> C;
		g[L - 1].emplace_back(R - 1, C);
	}
	
	vector<Int> d(N, INF);
	dijkstra(g, d, 0);
	cout << (d[N - 1] < INF ? d[N - 1] : -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>
#define Int int64_t

using namespace std;

template <typename T>
struct edge {
	int to;
	T cost;
	edge(int t, T c) : to(t), cost(c) {}
};
template <typename T>
void dijkstra(const vector<vector< edge<T> >>& G, vector<T>& d, int s) {
	priority_queue<pair<T, int>, vector< pair<T, int> >, greater< pair<T, int> >> que;
	d[s] = 0;
	que.emplace(0, s);

	while (!que.empty()) {
		auto p = que.top();
		que.pop();
		int u = p.second;
		if (d[u] < p.first) { continue; }

		for (auto e : G[u]) {
			if (d[e.to] <= d[u] + e.cost) { continue; }
			d[e.to] = d[u] + e.cost;
			que.emplace(d[e.to], e.to);
		}
	}
}

int main() {
	const Int INF = 1e18;
	int N, M;
	cin >> N >> M;
	vector<vector< edge<Int> >> g(N);
	for (int i = 1; i < N; ++i) {
		g[i].emplace_back(i - 1, 0);
	}
	for (int i = 0; i < M; ++i) {
		int L, R, C;
		cin >> L >> R >> C;
		g[L - 1].emplace_back(R - 1, C);
	}
	
	vector<Int> d(N, INF);
	dijkstra(g, d, 0);
	cout << (d[N - 1] < INF ? d[N - 1] : -1) << endl;

	return 0;
}

```