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>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

const int INF = 1e9;

int V, E;
vector<vector<int> > dist;
vector<vector<int> > dp;

int rec(int S = (1 << V) - 1, int to = 0) {
    if (S == 0) {
        return (to) ? INF : 0;
    }
    if (!(S & (1 << to))) {
        return INF;
    }
    int &ret = dp.at(S).at(to);
    if (ret != -1) {
        return ret;
    }
    ret = INF;
    for (int from = 0; from < V; ++from) {
        ret = min(ret, rec(S ^ (1 << to), from) + dist.at(from).at(to));
    }
    return ret;
}

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

    cin >> V >> E;
    dist.assign(V, vector<int>(V, INF));
    for (int i = 0; i < E; ++i) {
        int s, t, d;
        cin >> s >> t >> d;
        dist.at(s).at(t) = d;
    }

    dp.resize(1 << V, vector<int>(V, -1));
    int ans = rec();

    cout << ((ans == INF) ? -1 : ans) << endl;

    return 0;
}
