#include <iostream> #include <algorithm> #include <iomanip> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = uint32_t; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208; template <class T, class U> vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); } template<class... Ts, class U> auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); } template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); } template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); } int main() { int n, m; cin >> n >> m; array<array<int, 20>, 20> v{}; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { v[i][j] = 0; } } for (int i = 0; i < m; ++i) { int a, b, c; cin >> a >> b >> c; a--; b--; chmax(v[a][b], c); chmax(v[b][a], c); } auto dp = make_v(n, 1<<n, 0); for (int mask = 0; mask < (1 << n); ++mask) { for (int i = 0; i < n; ++i) { if(mask & (1 << i)){ int from = mask^(1<<i); for (int j = 0; j < n; ++j) { if((from & (1<<j)) && v[j][i]){ chmax(dp[i][mask], dp[j][from]+v[j][i]); } } } } } int ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < 1<<n; ++j) { chmax(ans, dp[i][j]); } } cout << ans << "\n"; return 0; }