#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll pref[305][305], dp[305][305][2];
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
for(int i=0; i<M; i++) pref[X[i]+1][Y[i]+1] += W[i];
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++) pref[i][j] += pref[i][j-1];
//nikad nema da ima pojse od 2 prazni kuli
for(int i=1; i<N; i++) {
for(int j=0; j<=N; j++) {
for(int k=0; k<=N; k++) {
if(j <= k) dp[i+1][k][1] = max(dp[i+1][k][1], dp[i][j][1] + pref[i][k] - pref[i][j]);
if(j >= k) dp[i+1][k][0] = max(dp[i+1][k][0], max(dp[i][j][0], dp[i][j][1]) + pref[i+1][j] - pref[i+1][k]);
if(i + 2 <= N) dp[i+2][k][0] = max(dp[i+2][k][0], max(dp[i][j][0], dp[i][j][1]) + max(pref[i+1][j], pref[i+1][k]));
if(i + 2 <= N) dp[i+2][k][1] = max(dp[i+2][k][1], max(dp[i][j][0], dp[i][j][1]) + max(pref[i+1][j], pref[i+1][k]));
}
}
}
ll ans = 0;
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++) ans = max({ ans, dp[i][j][0] + pref[i+1][j], dp[i][j][1] + pref[i+1][j] });
return ans;
}
