#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int n,m,k,md[1010];;
VI v[1010];
int main() {
	scanf("%d%d%d",&n,&m,&k);
	rep(j,0,k) {
		int s=0,x;
		rep(i,1,n+1) {
			scanf("%d",&x);
			s+=x;
			v[i].pb(s);
		}
	}
	rep(i,1,n+1) sort(all(v[i]));
	rep(i,1,n+1) md[i]=v[i][k/2];
	rep(i,1,n+1) printf("%d ",md[i]-md[i-1]); puts("");
}