import java.util.*;

public class ReverseMin {
    public static void main(String[] args) {
        int i, min, minrow = 0;
        boolean f;
        Scanner in = new Scanner(System.in);
        ArrayList<Integer> mincolumn = new ArrayList<>();
        ArrayList<ArrayList<Integer>> list = new ArrayList<>();
        while (in.hasNextLine()) {
            Scanner line = new Scanner(in.nextLine());
            ArrayList<Integer> numbers = new ArrayList<>();
            i = 0;
            f = true;
            while (line.hasNextInt()) {
                numbers.add(line.nextInt());
                if (mincolumn.size() < (i + 1)) {
                    mincolumn.add(numbers.get(i));
                } else if (numbers.get(i) < mincolumn.get(i)) {
                    mincolumn.set(i, numbers.get(i));
                }
                if (f) {
                    minrow = numbers.get(i);
                    f = false;
                } else if (numbers.get(i) < minrow) {
                    minrow = numbers.get(i);
                }
                i++;
            }
            numbers.add(minrow);
            list.add(numbers);
        }
        for (i = 0; i < list.size(); i++){
            for (int j = 0; j < list.get(i).size() - 1; j++) {
                min = list.get(i).get(list.get(i).size() - 1);
                if (mincolumn.get(j) < min) {
                    min = mincolumn.get(j);
                }
                System.out.print(min + " ");
            }
            System.out.println();
        }
    }
}