#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, k, W;
    cin >> n >> k >> W;
    vector<vector<int> > a(n, vector<int>(n));
    vector<vector<int> > c(n, vector<int>(n));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> a[i][j];
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> c[i][j];
            c[i][j]--;
        }
    }
    vector<int> pos[11];
    for(int i = 1; i < 1 << k; i++){
        pos[__builtin_popcount(i)].push_back(i);
    }
    const int INF = 0x3f3f3f3f;
    for(int cnt = 1; cnt <= k; cnt++){
        for(auto x : pos[cnt]){
            if (!(x >> c[0][0] & 1)) continue;
            vector<vector<int> > dp(n, vector<int>(n, INF));
            vector<vector<pair<int, int> > > pre(n, vector<pair<int, int> >(n));
            dp[0][0] = a[0][0];
            for(int i = 0; i < n; i++){
                for(int j = 0; j < n; j++){
                    if (i + 1 < n and (x >> c[i + 1][j] & 1)){
                        if (dp[i][j] + a[i + 1][j] < dp[i + 1][j]){
                            dp[i + 1][j] = dp[i][j] = a[i + 1][j];
                            pre[i + 1][j] = {i, j};
                        }
                    }
                    if (j + 1 < n and (x >> c[i][j + 1] & 1)){
                        if (dp[i][j] + a[i][j + 1] < dp[i][j + 1]){
                            dp[i][j + 1] = dp[i][j] + a[i][j + 1];
                            pre[i][j + 1] = {i, j};
                        }
                    }
                }
            }
            if (dp[n - 1][n - 1] <= W){
                vector<pair<int, int> > ans{{n - 1, n - 1}};
                while(ans.back() != pair{0, 0}){
                    ans.push_back(pre[ans.back().first][ans.back().second]);
                }
                reverse(ans.begin(), ans.end());
                cout << cnt << '\n';
                for(auto [x, y] : ans) cout << x + 1 << ' ' << y + 1 << ' ';
                cout << '\n';
                return 0;
            }
        }
    }
    cout << -1 << '\n';

}