#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <limits>

using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
const ll INF = (ll)1e18;
const int MAXN = 100005;
vector<P> G[MAXN];
int n, m;

ll dijkstra(int start) {
  vector<ll> dist(n, INF);
  priority_queue<pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > q;
  dist[start] = 0;
  q.emplace(0, start);
  while (!q.empty()) {
    pair<ll, int> cur = q.top(); q.pop();
    ll d = cur.first;
    int v = cur.second;
    if (dist[v] < d) continue;
    for (int i = 0; i < G[v].size(); ++i) {
      P next = G[v][i];
      ll d2 = next.second + d;
      int u = next.first;
      if (d2 < dist[u]) {
	dist[u] = d2;
	q.emplace(d2, u);
      }
    }
  }
  return dist[n - 1];
}
int main() {
  cin >> n >> m;

  for (int i = 0; i < n - 1; ++i) G[i + 1].push_back(P(i, 0LL));
  for (int i = 0; i < m; ++i) {
    int l, r;
    ll c;
    cin >> l >> r >> c;
    l--; r--;
    G[l].push_back(P(r, c));
  }

  ll ans = dijkstra(0);
  if (ans == INF) puts("-1");
  else cout << ans << endl;
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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 <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <limits>

using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
const ll INF = (ll)1e18;
const int MAXN = 100005;
vector<P> G[MAXN];
int n, m;

ll dijkstra(int start) {
  vector<ll> dist(n, INF);
  priority_queue<pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > q;
  dist[start] = 0;
  q.emplace(0, start);
  while (!q.empty()) {
    pair<ll, int> cur = q.top(); q.pop();
    ll d = cur.first;
    int v = cur.second;
    if (dist[v] < d) continue;
    for (int i = 0; i < G[v].size(); ++i) {
      P next = G[v][i];
      ll d2 = next.second + d;
      int u = next.first;
      if (d2 < dist[u]) {
	dist[u] = d2;
	q.emplace(d2, u);
      }
    }
  }
  return dist[n - 1];
}
int main() {
  cin >> n >> m;

  for (int i = 0; i < n - 1; ++i) G[i + 1].push_back(P(i, 0LL));
  for (int i = 0; i < m; ++i) {
    int l, r;
    ll c;
    cin >> l >> r >> c;
    l--; r--;
    G[l].push_back(P(r, c));
  }

  ll ans = dijkstra(0);
  if (ans == INF) puts("-1");
  else cout << ans << endl;
  return 0;
}

```