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
//Krzysztof Pieprzak
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <deque>
#include <stack>
#include <map>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define Size(x) (int)x.size()
#define VAR(v,n) typeof(n)v = (n)
#define FOR(i,a,b) for(VAR(i,a); i < (b); ++i)
#define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i)
#define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i)
#define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step))
#define FOREACH(i,c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define ALL(x) x.begin(),x.end()
#define CLEAR(t) memset(t, 0, sizeof(t))
#define F first
#define S second
#define MP make_pair
#define PUB push_back
#define POB pop_back
#define pieprzu ios_base::sync_with_stdio(0);

#define TEST 0

const int    INF = 1000000001;
const double EPS = 10e-9;

const int MAXN = 100005;
const int MAXK = 6;

int t[MAXK][MAXN];
int res[MAXN];

void solve2(int n)
{
    ll sum = 0;
    FOR (i, 0, n) sum += abs(t[0][i]-t[1][i]);

    FOR (i, 0, n) res[i] = t[0][i];

    ll goal = sum/2;
    FOR (i, 0, n)
    {
        if (abs(t[0][i]-t[1][i]) <= goal)
        {
            res[i] = t[1][i];
            goal -= abs(t[0][i]-t[1][i]);
            if (!goal) break;
        }
        else
        {
            if (t[0][i] < t[1][i]) res[i] = t[0][i]+goal;
            else res[i] = t[0][i]-goal;
            break;
        }
    }
}

void rest(int n)
{
    FOR (i, 0, n) res[i] = t[0][i];
}

void rob()
{
    int n,k;
    scanf("%d %d", &n, &k);

    FOR (i, 0, k)
        FOR (j, 0, n)
            scanf("%d", &t[i][j]);

    if (k == 2) solve2(n);
    else rest(n);

    if (TEST)
    {
        ll mx = 0;
        FOR (i, 0, k)
        {
            ll tmp = 0;
            FOR (j, 0, n) tmp += abs(t[i][j]-res[j]);
            mx = max(mx,tmp);
        }
        printf("%I64d\n", mx);
    }
    else
    {
        FOR (i, 0, n) printf("%d ", res[i]);
    }
    printf("\n");
}

int main()
{
    int test = 1;
    //scanf("%d", &test);

    while (test--) rob();

    return 0;
}