#include <bits/stdc++.h>
#define dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<

using namespace std;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, m; cin >> n >> m;
  vector<vector<pair<int, int>>> adj(n);
  for (int i = 0; i < m; ++i) {
    int a, b, c; cin >> a >> b >> c; --a, --b;
    adj[a].emplace_back(b, c);
  }
  for (int i = 0; i < n - 1; ++i) {
    adj[i + 1].emplace_back(i, 0);
  }
  const long long INF = (long long)1e18L;
  vector<long long> dist(n, INF);
  priority_queue<pair<long long, int>, 
    vector<pair<long long, int>>,
      greater<pair<long long, int>>> pq;
  pq.emplace(0, 0);
  dist[0] = 0;
  while (!pq.empty()) {
    int node; long long cost; tie(cost, node) = pq.top(); pq.pop();
    if (dist[node] < cost) continue;
    if (node == n - 1) {
      cout << cost << endl;
      return 0;
    }
    for (auto &p : adj[node]) {
      int x, c; tie(x, c) = p;
      if (cost + c < dist[x]) {
        dist[x] = cost + c;
        pq.emplace(dist[x], x);
      }
    }
  }
  cout << "-1\n";

  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
### 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 dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<

using namespace std;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, m; cin >> n >> m;
  vector<vector<pair<int, int>>> adj(n);
  for (int i = 0; i < m; ++i) {
    int a, b, c; cin >> a >> b >> c; --a, --b;
    adj[a].emplace_back(b, c);
  }
  for (int i = 0; i < n - 1; ++i) {
    adj[i + 1].emplace_back(i, 0);
  }
  const long long INF = (long long)1e18L;
  vector<long long> dist(n, INF);
  priority_queue<pair<long long, int>, 
    vector<pair<long long, int>>,
      greater<pair<long long, int>>> pq;
  pq.emplace(0, 0);
  dist[0] = 0;
  while (!pq.empty()) {
    int node; long long cost; tie(cost, node) = pq.top(); pq.pop();
    if (dist[node] < cost) continue;
    if (node == n - 1) {
      cout << cost << endl;
      return 0;
    }
    for (auto &p : adj[node]) {
      int x, c; tie(x, c) = p;
      if (cost + c < dist[x]) {
        dist[x] = cost + c;
        pq.emplace(dist[x], x);
      }
    }
  }
  cout << "-1\n";

  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
```