#include <bits/stdc++.h>

using namespace std;
using int64 = long long;

constexpr int DEBUG = 0;

struct Edge {
  int l;
  int r;
  int64 c;
};

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

  int n, m;
  cin >> n >> m;
  vector<vector<Edge>> v_to_edges(n);
  for (int i = 0; i < m; i++) {
    int l;
    int r;
    int64 c;
    cin >> l >> r >> c;
    l--;
    r--;
    Edge e({l, r, c});
    v_to_edges[l].push_back(e);
  }

  multiset<int64> s;
  constexpr int64 INF = 1E18;
  vector<int64> dp(n, INF);
  vector<vector<int64>> v_to_ends(n);
  dp[0] = 0;
  for (const auto& e : v_to_edges[0]) {
    s.insert(e.c);
    v_to_ends[e.r].push_back(e.c);
  }

  for (int v = 1; v < n; v++) {
    if (!s.empty()) {
      dp[v] = *s.begin();
    }
    if (dp[v] == INF) continue;
    for (int64 x : v_to_ends[v]) {
      s.erase(s.find(x));
    }
    for (const auto& e : v_to_edges[v]) {
      s.insert(dp[v] + e.c);
      v_to_ends[e.r].push_back(dp[v] + e.c);
    }
  }

  if (dp[n - 1] == INF) {
    cout << -1 << endl;
  } else {
    cout << dp[n - 1] << 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>

using namespace std;
using int64 = long long;

constexpr int DEBUG = 0;

struct Edge {
  int l;
  int r;
  int64 c;
};

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

  int n, m;
  cin >> n >> m;
  vector<vector<Edge>> v_to_edges(n);
  for (int i = 0; i < m; i++) {
    int l;
    int r;
    int64 c;
    cin >> l >> r >> c;
    l--;
    r--;
    Edge e({l, r, c});
    v_to_edges[l].push_back(e);
  }

  multiset<int64> s;
  constexpr int64 INF = 1E18;
  vector<int64> dp(n, INF);
  vector<vector<int64>> v_to_ends(n);
  dp[0] = 0;
  for (const auto& e : v_to_edges[0]) {
    s.insert(e.c);
    v_to_ends[e.r].push_back(e.c);
  }

  for (int v = 1; v < n; v++) {
    if (!s.empty()) {
      dp[v] = *s.begin();
    }
    if (dp[v] == INF) continue;
    for (int64 x : v_to_ends[v]) {
      s.erase(s.find(x));
    }
    for (const auto& e : v_to_edges[v]) {
      s.insert(dp[v] + e.c);
      v_to_ends[e.r].push_back(dp[v] + e.c);
    }
  }

  if (dp[n - 1] == INF) {
    cout << -1 << endl;
  } else {
    cout << dp[n - 1] << endl;
  }
}
```