#include<bits/stdc++.h>
#define irep(i,l,r) for(int i = l; i <= r; ++i)
#define drep(i,r,l) for(int i = r; i >= l; --i)
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-Abs(pp)/Abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(abs(pp),abs(qq)):(pp)/(qq))
#define ll long long
using namespace std;
ll Abs(ll x){return x > 0 ? x : - x;}
inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

const int itinf = 2e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;
//transition
ll col[1002][1002], w[1002][1002], dis[404][404], trans[404][404];
vector<int>nxt;
int popcnt(int x){
	return x ? 1 + popcnt(x - (x & -x)) : 0;
}
int minans = itinf;
ll ans[404][404];
void print(int x,int y){
	if(x > 1 || y > 1){
		if(ans[x][y] == 0)print(x - 1, y);
		else print(x, y - 1);
	}
	printf("%d %d ",x,y);
}
int main(){
	int n = read(), k = read(), lim = read();
	irep(i,1,n){
		irep(j,1,n){
			w[i][j] = read();
		}
	}
	irep(i,1,n){
		irep(j,1,n){
			col[i][j] = read() - 1;
		}
	}
	for(int S = 0; S < (1 << k); ++ S){
		if(S & (1 << col[1][1])){
			memset(dis,0x3f,sizeof(dis));
			memset(trans,-1,sizeof(trans));
			dis[1][1] = w[1][1];
			for(int i = 1; i <= n; ++ i){
				for(int j = 1; j <= n; ++ j){
					//if(i == 1 && j == 1)continue;
					if(S & (1 << col[i][j])){
						if(i >= 2)dis[i][j] = dis[i - 1][j] + w[i][j], trans[i][j] = 0;
						if(j >= 2 && dis[i][j] > dis[i][j - 1] + w[i][j])dis[i][j] = dis[i][j - 1] + w[i][j], trans[i][j] = 1;
					}
				}
			}
			if(popcnt(S) < minans && dis[n][n] <= lim){
				swap(ans, trans);
				minans = popcnt(S);
			}
		}
	}
	if(minans == itinf)puts("-1");
	else{
		printf("%lld\n",minans);
		print(n,n);
	}
	return 0;
}