1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 100100;
const int K = 5;
int tab[K][N];
int kand[N];
bool r[N];
ll sum[K];
int n, k;

int mediana(int ind) {
	vi vek;
	REP(i, k) vek.PB(tab[i][ind]);
	sort(ALL(vek));
	if (k % 2 == 0) {
		return (vek[SIZE(vek) /2] + vek[SIZE(vek)/2 - 1]) / 2;
	}
	return vek[SIZE(vek) / 2];
}

ll getRes() {
	ll wyn = sum[0];
	FOR(i, 1, k - 1) REMAX(wyn, sum[i]);
	return wyn;
}

vector<pair<ll, int>> getOrdered() {
	vector<pair<ll, int>> zb;
	REP(i, k) zb.PB(mp(sum[i], i));
	sort(ALL(zb));
	reverse(ALL(zb));
	return zb;
}
ll pos[K];
int main() {
	scanf("%d %d", &n, &k);
	REP(i, k) {
		REP(j, n) scanf("%d", &tab[i][j]);
	}
	if (k == 2) {
		int diffs = 0;
		REP(i, n) {
			kand[i] = (tab[0][i] + tab[1][i]) / 2;
			if ((abs(tab[0][i] - tab[1][i]) & 1))
				++diffs;
			REP(j, k) sum[j] += abs(kand[i] - tab[j][i]);
		}
		//printf("diffs: %d, sum1: %lld, sum2: %lld\n", diffs, sum[0], sum[1]);
		diffs /= 2;
		REP(i, n) {
			auto ordi = getOrdered();
			if ((abs(tab[0][i] - tab[1][i]) &1) && (tab[ordi[0].ND][i] > tab[ordi[1].ND][i])) {
				++kand[i];
				--sum[ordi[0].ND];
				++sum[ordi[1].ND];
				if (abs(sum[0] - sum[1]) <= 1) break;
			}
		}
		
	} else if (k == 3) {
		REP(i, n) {
			kand[i] = mediana(i);
			REP(j, k) sum[j] += abs(kand[i] - tab[j][i]);
		}
		REP(i, n) {
			const auto& curr = getOrdered();
			//REP(i, k) printf("%lld - %d\n", curr[i].ST, curr[i].ND);
			if (curr[0].ST - curr[1].ST <= 1) break;
			if (kand[i] != tab[curr[0].ND][i]) {
				ll dist = abs(kand[i] - tab[curr[0].ND][i]);
				ll diff = curr[0].ST - curr[1].ST;
				ll ruch = min(dist, diff/2);
				if (tab[curr[0].ND][i] > kand[i]) {
					kand[i] += ruch;
				} else {
					kand[i] -= ruch;
				}
				sum[curr[0].ND] -= ruch;
				FOR(i, 1, k - 1) {
					sum[curr[i].ND] += ruch;
				}
			}
		}
	} else {

	}
	REP(i, n) printf("%d ", kand[i]); printf("\n");
	//printf("%lld\n", getRes());
	return 0;
}