#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	long long m; cin >> m;
	vector t(300, vector<long long>(n));

	rep(i, n)cin >> t[0][i];
	vector a(n, vector<int>(n));
	rep(i, n)rep(j, n)cin >> a[i][j];
	rep(i, 20) {
		rep(j, n)rep(k, n)chmax(t[i + 1][k], t[i][j] + a[j][k]);
	}
	if (m < 300) {
		rep(i, n)cout << t[m][i] << " ";
		cout << endl;
		return 0;
	}
	rrep(i, 300) {
		if (i%n == m % n){
			vector<long long>ans(n);
			rep(j, n) {
				long long diff = t[i][j] - a[i - n][j];
				long long x = (m - i) / n;
				ans[j] = t[i][j] + x * diff;
			}
			rep(j, n)cout << ans[j] << " ";
			return 0;
		}
	}
	return 0;
}