#include <stdio.h>
#define n 3

void enter (int a[n][n])
{
	int i,j;
	for (i=0; i<n; i++)
		for (j=0; j<n; j++)
			scanf ("%d",&a[i][j]);
}

void print (int a[n][n])
{
	int i,j;
	for (i=0; i<n; i++)
	{
		for (j=0; j<n; j++)
			printf ("%3d",a[i][j]);
		printf ("\n");
	}
	printf ("\n");
}

void sort (int a[n][n], int index)
{
	int tmp,j,flag;
	do
	{
		flag = 1;
		for (j=0; j<n-1; j++)
		{
			if (a[index][j] > a[index][j+1])
			{
				flag = 0;
				tmp = a[index][j];
				a[index][j] = a[index][j+1];
				a[index][j+1] = tmp;
			}
		}
	}
	while (!flag);
}

int main()
{
	int a[n][n];
	int i,j,mini=0,minj=0;
	enter(a);
	print(a);
	for (i=0; i<n; i++)
		for (j=0; j<n; j++)
			if (a[i][j]<a[mini][minj])
			{
				mini = i;
				minj = j;
			}
	sort (a,mini);
	print (a);
	return 0;
}