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

Solution (in JAVA):

Solution:



import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.TreeMap;



public class Main {


	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();

		HashMap<Integer, ArrayList<Range>> leftMap = new HashMap<>();
		HashMap<Integer, ArrayList<Range>> rightMap = new HashMap<>();
		for (int i=0;i<=n;i++) {
			leftMap.put(i, new ArrayList<Range>());
			rightMap.put(i, new ArrayList<Range>());
		}

		for (int i=0;i<m;i++) {
			Range range = new Range();
			range.left=sc.nextInt();
			range.right=sc.nextInt();
			range.cost=sc.nextLong();
			leftMap.get(range.left).add(range);
			rightMap.get(range.right).add(range);
		}

		TreeMap<Long, HashSet<Range>> available = new TreeMap<>();

		Range dummy = new Range();
		dummy.left=1;
		dummy.right=1;
		dummy.cost=0L;
		dummy.totalCost=0L;
		rightMap.get(1).add(dummy);
		available.put(0L, new HashSet<Range>());
		available.get(0L).add(dummy);

		for (int i=1;i<=n;i++) {
			for (Range r : rightMap.get(i-1)) {
				if (available.containsKey(r.totalCost)) {
					available.get(r.totalCost).remove(r);
					if (available.get(r.totalCost).isEmpty()) {
						available.remove(r.totalCost);
					}
				}
			}
			for (Range r : leftMap.get(i)) {
				if (!available.isEmpty()) {
					r.totalCost=available.firstKey()+r.cost;
					if (!available.containsKey(r.totalCost)) {
						available.put(r.totalCost, new HashSet<Range>());
					}
					available.get(r.totalCost).add(r);
				}
			}
		}

		System.out.println(available.isEmpty() ? -1 : available.firstKey());
	}

}

class Range {
	int left;
	int right;
	long cost;
	long totalCost;
}