/*
khoi orz, go check out his algo
-normie-
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int64_t i=0;i < (int64_t)(n);i++)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FILE_IN "ninja.inp"
#define FILE_OUT "ninja.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define max(x,y) (((x)>(y))?(x):(y))
#define min(x,y) (((x)<(y))?(x):(y))
#define ord(a,b,c) ((a>=b)and(b>=c))
#define MOD (ll(1000000007))
#define MAX 300001
#define mag 1048576
#define fi first
#define se second
#define pow2(x) (ll(1)<<x)
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plll pair<ll,pll>
#define For(i,__,___) for(int i=__;i<=___;i++)
#define Rep(i,__,___) for(int i=__;i>=___;i--)
#define ordered_set tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update>
#define endl "\n"
#define bi BigInt
#define ll long long
#define pi 3.1415926535897
#include "tickets.h"
#define round roundd
//------START-----------//
vector<int> gt[100001];
int l[100001],r[100001],res[1501][1501],profit[1501];
int n,m,i,j,round;
long long sum=0;
//------END-----------//
long long find_maximum(int k, vector<vector<int>> v)
{
sum=0;
n=v.size();
m=v[0].size();
for (i=0;i<n;i++)
{
l[i]=0;
r[i]=m-1;
profit[i]=v[i][l[i]]+v[i][r[i]];
for (j=0;j<m;j++) res[i][j]=-1;
}
vector<int> fuc;
for (i=0;i<n;i++) fuc.push_back(i);
for (int round=0;round<k;round++)
{
for (i=0;i<n;i++)
profit[i]=v[i][l[i]]+v[i][r[i]];
sort(fuc.begin(),fuc.end(),[v](int a, int b){return (profit[a]<profit[b]);});
for (i=0;i<fuc.size()/2;i++) {res[fuc[i]][l[fuc[i]]]=round; sum-=v[fuc[i]][l[fuc[i]]]; l[fuc[i]]++;}
for (i=fuc.size()/2;i<fuc.size();i++)
{res[fuc[i]][r[fuc[i]]]=round; sum+=v[fuc[i]][r[fuc[i]]]; r[fuc[i]]--;}
}
vector<vector<int>> res2;
for (i=0;i<n;i++)
{
res2.push_back({});
for (j=0;j<m;j++) res2[i].push_back(res[i][j]);
}
allocate_tickets(res2);
return sum;
}
