#include #include #include #include #include #include #define Max(a, b) ((a) > (b) ? (a) : (b)) #define Min(a, b) ((a) > (b) ? (b) : (a)) #define abs(x) ((x) > 0 ? (x) : -(x)) #define rep(i, n) for(int i = 0; i < (n); i++) #define MOD 1000000007 //10^9 + 7 #define endl printf("\n") typedef long long ll; #define MAX_N 16 int dp[1 << MAX_N][MAX_N]; int n, d[MAX_N][MAX_N]; int rec(int s, int v) { if (dp[s][v] > 0) return dp[s][v]; int r = 0; for (int i = 0; i < n; i++) { if ((!(s >> i & 1)) && d[v][i] != 0) { r = Max(r, rec(s | 1 << i, i) + d[v][i]); } } return dp[s][v] = r; } int main(int argc, char **argv) { int m; scanf("%d %d", &n, &m); int a, b, c; for (int i = 0; i < m; i++) { scanf("%d %d %d", &a, &b, &c); a--; b--; d[a][b] = Max(d[a][b], c); d[b][a] = Max(d[b][a], c); } int ans = 0; for (int i = 0; i < n; i++) { ans = Max(ans, rec(1 << i, i)); } printf("%d\n", ans); return 0; }