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
129
130
131
132
133
134
135
136
137
138
139
140
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

#define MR 100010
#define MS 10

int a[MR][5];

LL sum[5];

int n, k;

LL check(int c, int p)	//spr jaka max roznice zapewni nam c na pozycji p
{
	LL res = abs(c-a[p][0]) + sum[0];
	FOR(i,1,k) res = max(res, sum[i]+abs(c-a[p][i]));
	return res;
}

int main()
{
	srand((int)time(NULL));
	scanf("%d%d", &n, &k);
	REP(i,k)REP(j,n) scanf("%d", &a[j][i]);
	REP(i,n)
	{
		int mina, maxa; mina = maxa = a[i][0];
		FOR(j,1,k)
		{
			mina = min(mina, a[i][j]);
			maxa = max(maxa, a[i][j]);
		}
		int ile = maxa-mina+1;
		int c = rand()%ile+mina;
		LL v = check(c,i);
		//poprawiaj kanydatow
		REP(j,k)FOR(l,j+1,k)
		{
			int pomc = min(a[i][j],a[i][l]) + (max(a[i][j],a[i][l])-min(a[i][j],a[i][l]))/2;
			LL pomv = check(pomc,i);
			if(pomv < v)
			{
				v = pomv;
				c = pomc;
			}
			int nc = pomc;
			REP(m,MS)
			{
				nc++;
				pomv = check(nc,i);
				if(pomv < v)
				{
					v = pomv;
					c = nc;
				}
			}
			nc = pomc;
			REP(m,MS)
			{
				nc--;
				pomv = check(nc,i);
				if(pomv < v)
				{
					v = pomv;
					c = nc;
				}
			}
		}
		//losuj kandydatow
		REP(j,MS)
		{
			int pomc = rand()%ile+mina;
			LL pomv = check(pomc,i);
			if(pomv < v)
			{
				v = pomv;
				c = pomc;
			}
			int nc = pomc;
			REP(l,MS)
			{
				nc++;
				pomv = check(nc,i);
				if(pomv < v)
				{
					v = pomv;
					c = nc;
				}
			}
			nc = pomc;
			REP(l,MS)
			{
				nc--;
				pomv = check(nc,i);
				if(pomv < v)
				{
					v = pomv;
					c = nc;
				}
			}
		}
		printf("%d ", c);
		REP(j,k) sum[j] += abs(a[i][j]-c);
	}
	printf("\n");
	return 0;
}