#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, k, W;
    std::cin >> n >> k >> W;
    
    std::vector w(n, std::vector<int>(n)), c(n, std::vector<int>(n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            std::cin >> w[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            std::cin >> c[i][j];
            c[i][j]--;
        }
    }
    
    int ans = k + 1;
    std::vector<std::array<int, 2>> path;
    for (int s = 0; s < (1 << k); s++) {
        if (__builtin_popcount(s) >= ans) {
            continue;
        }
        std::vector dp(n, std::vector<int>(n, W + 1));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (s >> c[i][j] & 1) {
                    if (!i && !j) {
                        dp[i][j] = w[i][j];
                    } else if (!i) {
                        dp[i][j] = dp[i][j - 1] + w[i][j];
                    } else if (!j) {
                        dp[i][j] = dp[i - 1][j] + w[i][j];
                    } else {
                        dp[i][j] = std::min(dp[i][j - 1], dp[i - 1][j]) + w[i][j];
                    }
                }
            }
        }
        if (dp[n - 1][n - 1] <= W) {
            ans = __builtin_popcount(s);
            path.clear();
            int x = n - 1, y = n - 1;
            while (true) {
                path.push_back({x, y});
                if (!x && !y) {
                    break;
                }
                if (!x || (y && dp[x][y - 1] < dp[x - 1][y])) {
                    y--;
                } else {
                    x--;
                }
            }
            std::reverse(path.begin(), path.end());
        }
    }
    if (ans > k) {
        std::cout << -1 << "\n";
        return 0;
    }
    std::cout << ans << "\n";
    for (int i = 0; i < n * 2 - 1; i++) {
        std::cout << path[i][0] + 1 << " " << path[i][1] + 1 << " \n"[i == n * 2 - 2];
    }
    
    return 0;
}