#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long
const int MAXN = 3e2+5, MAXX = 10;
int n,m;
int dp[MAXN][MAXN][MAXX], g[MAXN][MAXN], p[MAXN][MAXN];
int cnt[MAXN][MAXN];
long long max_weights(int32_t N, int32_t M, std::vector<int32_t> X, std::vector<int32_t> Y, std::vector<int32_t> W) {
n = N; m = M;
int xn = 0;
FOR(i,0,m) {
g[X[i]][Y[i]] = W[i];
xn = max(xn,Y[i]*1LL);
}
FOR(i,1,n+1) {
FOR(j,1,n+1) {
p[i][j] = p[i][j-1]+g[i-1][j-1];
}
}
// FORR(j,n,0) {
// FOR(i,1,n+1) cout << p[i][j] << " ";
// cout << ln;
// }
// cout << ln;
FOR(i,2,n+1) {
FOR(j,0,n+1) {
FOR(k,0,n+1) {
FOR(l,0,xn+2) {
if (j > k) {
int cur = dp[i-1][k][l]+max(0LL,p[i-1][j]-p[i-1][max(k,l)]);
if (cur > dp[i][j][k]) {
dp[i][j][k] = cur;
// cnt[i][j] = j;
}
}
else {
if (dp[i-1][k][l]+p[i][k]-p[i][j] > dp[i][j][k]) {
dp[i][j][k] = dp[i-1][k][l]+p[i][k]-p[i][j];
// cnt[i][j] = k;
}
}
}
}
}
}
// FORR(j,n,-1) {
// FOR(i,1,n+1) cout << dp[i][j] << " ";
// cout << ln;
// }
int res = -LLINF;
FOR(j,0,n+1) {
FOR(k,0,xn+2) res = max(res, dp[n][j][k]);
}
return res;
}
