#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 302;
int n;
int a[N][N];
bool smaller;
int max_m, max_n;
long long pref[N][N];
long long dp[N][N][N];
long long bt(int col, int last, int last2) {
if (col > n || (smaller && col > 5)) {
return 0;
}
long long& ret = dp[col][last][last2];
if (ret != -1) {
return ret;
}
long long sum = 0;
long long ps = pref[col][last];
for (int nlast = 0; nlast <= min(n, 11); ++nlast) {
if (nlast > last2 && nlast > last) sum += a[col - 1][nlast];
if (nlast <= last) ps -= a[col][nlast];
//if (sum) assert(ps == 0);
ret = max(ret, bt(col + 1, nlast, last) + sum + ps);
}
return ret;
}
long long max_weights(int N_, int M, vector<int> X, vector<int> Y, vector<int> W) {
n = N_;
bool even = true;
bool zero_Y = true;
smaller = true;
for (int i = 0; i < M; ++i) {
max_m = max(max_m, X[i] + 1);
max_n = max(max_n, Y[i] + 1);
zero_Y &= Y[i] == 0;
even &= X[i] % 2 == 0;
smaller &= X[i] <= 1;
a[X[i] + 1][Y[i] + 1] = W[i];
}
if (even || zero_Y) {
return accumulate(W.begin(), W.end(), 0LL);
}
for (int i = 1; i <= max_m; ++i) {
for (int j = 1; j <= max_n; ++j) {
pref[i][j] = pref[i][j - 1] + a[i][j];
}
}
memset(dp, -1, sizeof dp);
return bt(1, 0, 0);
}
