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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.AbstractMap;
import java.util.TreeMap;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemD_ShortestPathOnALine solver = new ProblemD_ShortestPathOnALine();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemD_ShortestPathOnALine {
        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            List<Segment>[] startingHere = new List[n];
            List<Long>[] endingHere = new List[n];
            for (int i = 0; i < n; i++) {
                startingHere[i] = new ArrayList<>();
                endingHere[i] = new ArrayList<>();
            }
            for (int i = 0; i < m; i++) {
                int l = in.nextInt() - 1;
                int r = in.nextInt() - 1;
                int c = in.nextInt();
                startingHere[l].add(new Segment(l, r, c));
            }

            long[] d = new long[n];
            TreeMap<Long, Integer> cnt = new TreeMap<>();
            for (int i = 0; i < n; i++) {
                if (i > 0) {
                    if (cnt.isEmpty()) {
                        out.println(-1);
                        return;
                    }
                    d[i] = cnt.firstKey();
                }
                for (Segment s : startingHere[i]) {
                    change(cnt, d[i] + s.c, +1);
                    endingHere[s.r].add(d[i] + s.c);
                }
                for (long c : endingHere[i]) {
                    change(cnt, c, -1);
                }
            }
            out.println(d[n - 1]);
        }

        private void change(TreeMap<Long, Integer> cnt, long key, int delta) {
            Integer val = cnt.get(key);
            if (val == null) {
                val = 0;
            }
            val += delta;
            if (val == 0) {
                cnt.remove(key);
            } else {
                cnt.put(key, val);
            }
        }

        class Segment {
            int l;
            int r;
            int c;

            Segment(int l, int r, int c) {
                this.l = l;
                this.r = r;
                this.c = c;
            }

        }

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    String rl = in.readLine();
                    if (rl == null) {
                        return null;
                    }
                    st = new StringTokenizer(rl);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}