#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;
ll max_weights(
int n, int m, vector<int> x, vector<int> y, vector<int> w) {
vector arr(n+1, vector<pair<int,ll>>());
for (int i = 0; i < m; i++) {
arr[x[i]+1].emplace_back(y[i], w[i]);
}
for (int i = 0; i < n; i++)
sort(arr[i].begin(), arr[i].end());
auto pref = arr;
for (int i = 0; i <= n; i++) {
for (int j = 1; j < pref[i].size(); j++) {
pref[i][j].second += pref[i][j-1].second;
}
}
auto sum_right = [&](int c, int right)->ll{
int l = -1, r = pref[c].size();
while (l < r-1) {
int mid = (l+r) / 2;
if (pref[c][mid].first <= right) l = mid;
else r= mid;
}
return l==-1 ? 0 : pref[c][l].second;
};
auto sum = [&](int c, int l, int r) { // [l, r]
if (l <= r) return sum_right(c, r) - sum_right(c, l-1);
else return 0ll;
};
vector memo(2, vector(n+1, vector(n+1, -1ll)));
auto dp = [&](auto& dp, bool inc, int c, int h2)->ll{
if (c == n+1) return 0;
ll& res = memo[inc][c][h2];
if (res!=-1) return res;
res = 0;
if (inc) {
for (int h3 = h2; h3 <= n; h3++) {
ll val = sum(c-1, h2, h3-1) + sum(c, h3, h2-1);
res = max(res, val + dp(dp, true, c+1, h3));
res = max(res, val + dp(dp, false, c+1, h3));
}
} else {
for (int h3 = 0; h3 <= h2; h3++) {
ll val = sum(c-1, h2, h3-1) + sum(c, h3, h2-1);
res = max(res, val + dp(dp, false, c+1, h3));
}
}
res = max(res, dp(dp, true, c+1, 0));
return res;
};
ll res = dp(dp, true, 1, 0);
return res;
}
