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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Set;

public class Main {

    private static class Entry {
        final int id;
        final long cost;
        
        Entry(int id, long cost) {
            this.id = id;
            this.cost = cost;
        }
    }

    public static void main(String[] args) throws IOException {
        int[][] costs;
        List<List<Entry>> links = new ArrayList<>();
        int n, m;
        try (BufferedReader in = new BufferedReader(new InputStreamReader(System.in))) {
            String[] array;
            array = in.readLine().split(" ");
            n = Integer.parseInt(array[0]);
            m = Integer.parseInt(array[1]);
            
            for (int i = 0; i < n; ++i) {
                links.add(new ArrayList<>());
            }

            for (int i = 0; i < m; ++i) {
                array = in.readLine().split(" ");
                int l = Integer.parseInt(array[0]) - 1;
                int r = Integer.parseInt(array[1]) - 1;
                int c = Integer.parseInt(array[2]);
                
                links.get(r).add(new Entry(l, c));
            }
        }
        
        BitSet closed = new BitSet();
        PriorityQueue<Entry> h = new PriorityQueue<>(Comparator.comparingLong(e -> e.cost));
        h.add(new Entry(n - 1, 0));
        while (!h.isEmpty()) {
            Entry e = h.poll();
            
            int n1 = e.id;
            if (closed.get(n1)) {
                continue;
            }
            closed.set(n1);
            if (n1 == 0) {
                System.out.println(e.cost);
                System.exit(0);
            }

            long c1 = e.cost;
            for (Entry e2 : links.get(n1)) {
                int n2 = e2.id;
                if (closed.get(n2)) {
                    continue;
                }
                long c2 = e2.cost;
                h.add(new Entry(n2, c1 + c2));
            }
            
            int n3 = n1 + 1;
            if (n3 < n) {
                if (!closed.get(n3)) {
                    h.add(new Entry(n3, c1));
                }
            }
        }
        System.out.println(-1);
    }
}