#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    vector<vector<int>> matrix(3, vector<int>(3));  // 3x3 matrix
    vector<int> input_numbers;
    int num;

    // Read the 3x3 matrix
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> matrix[i][j];
        }
    }

    // Read the input numbers
    while (cin >> num) {
        input_numbers.push_back(num);
    }

    // Sort the input numbers
    sort(input_numbers.begin(), input_numbers.end());

    // Flatten the 3x3 matrix into a single vector
    vector<int> matrix_elements;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            matrix_elements.push_back(matrix[i][j]);
        }
    }

    // Sort the matrix elements to find the smallest ones
    sort(matrix_elements.begin(), matrix_elements.end());

    // Replace the smallest elements of the matrix with the sorted input numbers
    int index = 0;
    for (int i = 0; i < 3 && index < input_numbers.size(); i++) {
        for (int j = 0; j < 3 && index < input_numbers.size(); j++) {
            matrix[i][j] = input_numbers[index++];
        }
    }

    // Output the updated 3x3 matrix
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            cout << matrix[i][j] << " ";
        }
        cout << endl;
    }

    return 0;
}