#include <iostream>
#include <vector>

int SIZE = 4;

std::vector<int> get_min_positions(const std::vector<std::vector<int>> &matrix) {
    std::vector<int> ans(matrix[0].size(), 0);
    for (int j = 0; j < matrix[0].size(); ++j) {
        for (int i = 0; i < matrix.size(); ++i) {
            if (matrix[i][j] < matrix[ans[j]][j])
                ans[j] = i;
        }
    }
    return ans;
}

int main() {
    std::vector<std::vector<int>> X(SIZE, std::vector<int>(SIZE, 0));
    for (int i = 0; i < SIZE; ++i) {
        for (int j = 0; j < SIZE; ++j) {
            std::cin >> X[i][j];
        }
    }

    std::vector<std::vector<int>> Y(SIZE, std::vector<int>(SIZE, 0));
    for (int i = 0; i < SIZE; ++i) {
        for (int j = 0; j < SIZE; ++j) {
            std::cin >> Y[i][j];
        }
    }

    std::vector<int> ans_X = get_min_positions(X);
    for (int i = 0; i < ans_X.size(); ++i) {
        std::cout << ans_X[i] << " ";
    }
    std::cout << std::endl;

    std::vector<int> ans_Y = get_min_positions(Y);
    for (int i = 0; i < ans_Y.size(); ++i) {
        std::cout << ans_Y[i] << " ";
    }
    std::cout << std::endl;

}