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.*;
import java.io.*;

public class Main {
	public static void main (String[] args) throws Exception {
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    String[] first = br.readLine().split(" ", 2);
		int n = Integer.parseInt(first[0]);
		int m = Integer.parseInt(first[1]);
		long[] score = new long[n + 2];
		Arrays.fill(score, Long.MAX_VALUE / 10);
		PriorityQueue<Path> queue = new PriorityQueue<>();
		for (int i = 0; i < m; i++) {
		    String[] line = br.readLine().split(" ", 3);
		    int a = Integer.parseInt(line[0]);
		    int b = Integer.parseInt(line[1]);
		    int c = Integer.parseInt(line[2]);
		    queue.add(new Path(a, b, c));
		}
		score[1] = 0;
		while (queue.size() > 0) {
		    Path p = queue.poll();
		    int left = p.from;
		    int right = n + 1;
		    while (right - left > 1) {
		        int mm = (left + right) / 2;
		        if (score[mm] > score[p.from] + p.value) {
		            right = mm;
		        } else {
		            left = mm;
		        }
		    }
		    for (int i = right; i <= p.to; i++) {
		        score[i] = Math.min(score[i], score[p.from] + p.value);
		    }
		}
		if (score[n] >= Long.MAX_VALUE / 10) {
		    System.out.println(-1);
		} else {
		    System.out.println(score[n]);
		}
	}
	
	static class Path implements Comparable<Path> {
	    int from;
	    int to;
	    int value;
	    
	    public Path(int from, int to, int value) {
	        this.from = from;
	        this.to = to;
	        this.value = value;
	    }
	    
	    public int compareTo(Path another) {
	        return from - another.from;
	    }
	}
}