#include "tickets.h"
//Bismillahirrahmanirrahim
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=0;i<n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1505;
const lo mod = 1000000007;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
vector<vector<int>> a;
lo orta=0;
for (int i = 0; i < n; i++) {
vector<int> vv(m);
for (int j = 0; j < m; j++) {
if (j < k) {
vv[j] = j;
orta+=x[i][j];
} else {
vv[j] = -1;
}
}
a.pb(vv);
}
allocate_tickets(a);
lo cev=0;
lo mn=inf;
for(int ii=0;ii<n;ii++){
orta=x[ii][0];
cev=0;
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++) {
if (j < k) {
cev+=abs(x[i][j]-orta);
}
}
}
mn=min(mn,cev);
}
return mn;
//~ return cev;
}
