Problem: Bankopolis is an incredible city in which all the n crossroads are located on a straight line and numbered from 1 to n along it. On each crossroad there is a bank office.

The crossroads are connected with m oriented bicycle lanes (the i-th lane goes from crossroad ui to crossroad vi), the difficulty of each of the lanes is known.

Oleg the bank client wants to gift happiness and joy to the bank employees. He wants to visit exactly k offices, in each of them he wants to gift presents to the employees.

The problem is that Oleg don't want to see the reaction on his gifts, so he can't use a bicycle lane which passes near the office in which he has already presented his gifts (formally, the i-th lane passes near the office on the x-th crossroad if and only if min(ui, vi) < x < max(ui, vi))). Of course, in each of the offices Oleg can present gifts exactly once. Oleg is going to use exactly k - 1 bicycle lane to move between offices. Oleg can start his path from any office and finish it in any office.

Oleg wants to choose such a path among possible ones that the total difficulty of the lanes he will use is minimum possible. Find this minimum possible total difficulty.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 80) — the number of crossroads (and offices) and the number of offices Oleg wants to visit.

The second line contains single integer m (0 ≤ m ≤ 2000) — the number of bicycle lanes in Bankopolis.

The next m lines contain information about the lanes.

The i-th of these lines contains three integers ui, vi and ci (1 ≤ ui, vi ≤ n, 1 ≤ ci ≤ 1000), denoting the crossroads connected by the i-th road and its difficulty.

Output

In the only line print the minimum possible total difficulty of the lanes in a valid path, or -1 if there are no valid paths.

Examples

Input

7 4
4
1 6 2
6 2 2
2 4 2
2 7 1


Output

6


Input

4 3
4
2 1 2
1 3 2
3 4 2
4 1 1


Output

3

Note

In the first example Oleg visiting banks by path 1 → 6 → 2 → 4.

Path 1 → 6 → 2 → 7 with smaller difficulity is incorrect because crossroad 2 → 7 passes near already visited office on the crossroad 6.

In the second example Oleg can visit banks by path 4 → 1 → 3.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * Created by vitalii on 13.02.2016.
 */
public class D {


    public void solve() throws IOException {
        int n = nextInt();
        int k = nextInt() - 1;
        if (k == 0)
        {
            out.println("0");
            return;
        }
        int max = 10000000;

        int[][] dist = new int[n][n];
        for (int i = 0; i < n; i++)
        {
            Arrays.fill(dist[i], max);
        }


        int m = nextInt();
        for (int i = 0; i < m; i++)
        {
            int st = nextInt()-1;
            int en = nextInt()-1;
            int cost = nextInt();
            dist[st][en] = Math.min(dist[st][en], cost);
        }


        int[][][][] dp = new int[2][n][n][k+1];

        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                for (int ck = 1; ck <= k; ck++)
                {
                    dp[0][i][j][ck] = max;
                    dp[1][i][j][ck] = max;
                }
            }
        }


        int ans = max;
        for (int curK = 1; curK <= k; curK++)
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = i+1; j < n; j++)
                {
                    for (int t = i; t <= j; t++)
                    {
                        if (t > i)
                        {
                            dp[0][i][j][curK] = Math.min(dp[0][i][j][curK], dist[i][t] + Math.min(dp[1][i+1][t][curK-1], dp[0][t][j][curK-1]));
                        }
                        if (t < j)
                        {
                            dp[1][i][j][curK] = Math.min(dp[1][i][j][curK], dist[j][t] + Math.min(dp[1][i][t][curK-1], dp[0][t][j-1][curK-1]));
                        }
                    }
                    if (curK == k)
                    {
                        ans = Math.min(ans, Math.min(dp[0][i][j][curK], dp[1][i][j][curK]));
                    }
                }
            }
        }
        out.println(ans == max ? -1 : ans);
    }


    public static void main(String[] args) throws IOException {
        new D().run();
    }

    public void run() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }

    BufferedReader in;
    PrintWriter out;
    StringTokenizer st;

    public String next() throws IOException {
        while (st == null || !st.hasMoreElements()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }

    public Long nextLong() throws IOException {
        return Long.parseLong(next());
    }

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


}