#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=1505;
int n,m,a[N][N];
ll sum;
vector<vector<int>> ans;
ll find_maximum(int k,vector<vector<int>> mat) {
n=mat.size(),m=mat[0].size(),ans=mat;
f(i,0,n) f(j,0,m) a[i][j]=mat[i][j],ans[i][j]=-1;
vector<pair<ll,ll>> vec;
f(i,0,n){
ans[i][m-1]=0;
sum+=a[i][m-1];
vec.pb({a[i][m-1]+a[i][0],i});
}
sort(all(vec));
f(i,0,n/2){
sum-=vec[i].F;
ans[vec[i].S][0]=0;
ans[vec[i].S][m-1]=-1;
}
allocate_tickets(ans);
return sum;
}
