/*
Normie's Template v2.0
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
#include "tickets.h"
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
int n,m,kk,i,j,t,t1,u,v,a,b;
vector<vector<int>> ord;
vector<vector<int>> pts;
vector<int> cntm,cntp;
vector<vector<int>> res;
ll val;
struct cmp
{
int operator()(int a, int b) const
{
int u=pts[a][ord[a][m-1-cntp[a]]]+pts[a][ord[a][cntm[a]-1]];
int v=pts[b][ord[b][m-1-cntp[b]]]+pts[b][ord[b][cntm[b]-1]];
if (u-v) return (u>v);
return (a<b);
}
};
set<int,cmp> se;
ll find_maximum(int k, vector<vector<int>> x)
{
pts=x;
n=x.size();
m=x[0].size();
kk=k;
for (i=0;i<n;i++)
{
ord.push_back({});
res.push_back({});
cntm.push_back(k);
cntp.push_back(0);
for (j=0;j<m;j++) ord[i].push_back(j);
for (j=0;j<m;j++) res[i].push_back(-1);
sort(ord[i].begin(),ord[i].end(),[](int a, int b){
return (pts[i][a]<pts[i][b]);
});
for (j=0;j<k;j++) val-=pts[i][ord[i][j]];
}
for (i=0;i<n;i++) se.insert(i);
for (i=0;i<k*n/2;i++)
{
u=*(se.begin());
se.erase(u);
v=pts[u][ord[u][m-1-cntp[u]]]+pts[u][ord[u][cntm[u]-1]];
val+=v;
cntp[u]++;
cntm[u]--;
if (cntm[u]) se.insert(u);
}
vector<int> vec;
for (i=0;i<n;i++) vec.push_back(i);
for (i=0;i<k;i++)
{
sort(vec.begin(),vec.end(),[](int a, int b){
return (cntp[a]>cntp[b]);
});
for (j=0;j<n/2;j++)
{
u=vec[j];
res[u][ord[u][m-cntp[u]]]=i;
cntp[u]--;
}
for (j=n/2;j<n;j++)
{
u=vec[j];
res[u][ord[u][cntm[u]-1]]=i;
cntm[u]--;
}
}
allocate_tickets(res);
return val;
}
