import numpy as np
f=open(0)
N,M=map(int,f.readline().split())
I=np.loadtxt(f,"q")
T=I[0];A=I[1:]
P=(np.eye(N,N,0,"q")-1)*2**62
while M:
	if M&1:P=(A[:,None]+P.T).max(2)
	A=(A[:,None]+A.T).max(2)
	M>>=1
print(*(T+P.T).max(1))