#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

// edit
int n, m;
vector<vector<pair<int,ll>>> G;
vector<vector<int>> E; // 辺が存在するかどうか

bool clique(vector<int> &vec){
    for(auto e : vec){
        for(auto f : vec){
            if(!E[e][f] && e != f){
                return false;
            }
        }
    }
    return true;
}

ll dfs(int v, vector<int> &vec){
    if(v == n){
        if(vec.size() <= 1) return false;
        ll ret = 0;
        for(int i = 0; i < vec.size(); ++i){
            ll tmp = INF;
            for(int j = 0; j < vec.size(); ++j){
                if(i != j) chmin(tmp, (ll)E[vec[i]][vec[j]]);
            }
            ret += tmp;
        }
        return ret;
    }
    
    ll ret1 = dfs(v + 1, vec);
    ll ret2 = 0;
    // vを加えてもクリーク
    vec.push_back(v);
    if(clique(vec)){
        ret2 = dfs(v + 1, vec);
    }
    vec.pop_back();
    
    ll ret = max(ret1, ret2);

    return ret;
}

void solve() {
    cin >> n >> m;
    G.resize(n);
    E.resize(n, vector<int>(n, 0));
    
    REP(i, m){
        int a,b,c;
        cin >> a >> b >> c;
        a--, b--;
        G[a].push_back(pair<int, ll>(b,c));
        G[b].push_back(pair<int, ll>(a,c));
        E[a][b] = E[b][a] = c;
    }
    
    vector<int> vec;
    ll ans = dfs(0, vec);
    
    cout << ans << endl;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    solve();


    return 0;
}



Measured memory_bytes: 3280