For a given weighted directed graph G(V, E), find the distance of the shortest route that meets the following criteria:

* It is a closed cycle where it ends at the same point it starts.
* It visits each vertex exactly once.

Constraints

* 2 ≤ |V| ≤ 15
* 0 ≤ di ≤ 1,000
* There are no multiedge

Input


|V| |E|
s0 t0 d0
s1 t1 d1
:
s|E|-1 t|E|-1 d|E|-1


|V| is the number of vertices and |E| is the number of edges in the graph. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively.

si and ti represent source and target vertices of i-th edge (directed) and di represents the distance between si and ti (the i-th edge).

Output

Print the shortest distance in a line. If there is no solution, print -1.

Examples

Input

4 6
0 1 2
1 2 3
1 3 9
2 0 1
2 3 6
3 2 4


Output

16


Input

3 3
0 1 1
1 2 1
0 2 1


Output

-1
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1ll << 60;

int n;
vector<vector<ll>> dist;
vector<vector<ll>> dp;

ll solve(int s, int v){
    if(dp[s][v] >= 0) return dp[s][v];
    if(s==(1<<n)-1 && v==0) return dp[s][v] = 0;

    ll ret = INF;
    rep(nv, n){
        if(!(s & (1<<nv))) ret = min(ret, solve(s|(1<<nv), nv) + dist[v][nv]);
    }

    dp[s][v] = ret;
    return ret;
}


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int m;
    cin >> n >> m;

    dist.assign(n, vector<ll>(n, INF));
    rep(i, m){
        int s, t;
        ll d;
        cin >> s >> t >> d;

        dist[s][t] = d;
    }

    dp.assign(1<<n, vector<ll>(n, -1));
    ll res = solve(0, 0);

    if(res == INF) cout << -1 << endl;
    else cout << res << endl;

    return 0;
}
