Problem:
Score : 1100 points

Problem Statement

We have a grid with N rows and M columns of squares.
Each integer from 1 to NM is written in this grid once.
The number written in the square at the i-th row from the top and the j-th column from the left is A_{ij}.

You need to rearrange these numbers as follows:

First, for each of the N rows, rearrange the numbers written in it as you like.

Second, for each of the M columns, rearrange the numbers written in it as you like.

Finally, for each of the N rows, rearrange the numbers written in it as you like.

After rearranging the numbers, you want the number written in the square at the i-th row from the top and the j-th column from the left to be M\times (i-1)+j.
Construct one such way to rearrange the numbers. The constraints guarantee that it is always possible to achieve the objective.

Constraints

1 \leq N,M \leq 100

1 \leq A_{ij} \leq NM

A_{ij} are distinct.

Input

Input is given from Standard Input in the following format:

N M
A_{11} A_{12} ... A_{1M}
:
A_{N1} A_{N2} ... A_{NM}

Output

Print one way to rearrange the numbers in the following format:

B_{11} B_{12} ... B_{1M}
:
B_{N1} B_{N2} ... B_{NM}
C_{11} C_{12} ... C_{1M}
:
C_{N1} C_{N2} ... C_{NM}

Here B_{ij} is the number written in the square at the i-th row from the top and the j-th column from the left after Step 1, and C_{ij} is the number written in that square after Step 2.

Sample Input 1

3 2
2 6
4 3
1 5

Sample Output 1

2 6
4 3
5 1
2 1
4 3
5 6

Sample Input 2

3 4
1 4 7 10
2 5 8 11
3 6 9 12

Sample Output 2

1 4 7 10
5 8 11 2
9 12 3 6
1 4 3 2
5 8 7 6
9 12 11 10

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		(new Main()).execute();
	}
	public void execute() { ;
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		// 整数の入力
		int N = sc.nextInt();
		int M = sc.nextInt();

		int A[][] = new int[N + 1][M + 1];
		int Z[][] = new int[N + 1][M + 1];
		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				A[i][j] = sc.nextInt();
				//横に動く
				int num = A[i][j] ;
				//横位置を見つける
				int m = num % M;
				if(m==0) {
					m = M ;
				}
				//縦位置を求める
				int n = (num-1)/M + 1;
				if(i == n && j == m) {
					Z[i][j] = 0 ;
				}else if(i == n ){
					Z[i][j] = 1 ;
				}else if(j == m ){
					Z[i][j] = 1 ;
				}else {
					Z[i][j] = 2 ;
				}
			}
		}
//		for(int i = 1 ; i <= N ; i ++) {
//			for(int j = 1 ; j <= M ; j ++) {
//				System.out.print("A[" + i + "][" + j + "]=" + A[i][j] + " ");
//			}
//			System.out.println();
//		}

		stepAll(N,M,A,Z);
	}

	public void stepAll(int N, int M, int A[][],int Z[][]){
		int B[][] = new int[N + 1][M + 1];
		int C[][] = new int[N + 1][M + 1];
		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				if(Z[i][j] != 0 ) {
					continue ;
				}
				//横に動く
				int num = A[i][j] ;
				//横位置を見つける
				int m = num % M;
				if(m==0) {
					m = M ;
				}
				//縦位置を求める
				int n = (num-1)/M + 1;

				if(B[i][m] == 0) {
					B[i][m] = num ;
					if(C[n][m] == 0) {
						C[n][m] = num ;
					}else {
						for(int k = 1; k <= N ; k ++) {
							if(C[n][k] == 0) {
								C[n][k] = num ;
								break ;
							}
						}
					}
				}else {
					for(int k = 1; k <= M ; k ++) {
						if(B[i][k] == 0 && C[n][k] == 0) {
							B[i][k] = num ;
							C[n][k] = num ;
							break ;
						}
					}
				}
			}
		}
		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				if(Z[i][j] != 1 ) {
					continue ;
				}
				//横に動く
				int num = A[i][j] ;
				//横位置を見つける
				int m = num % M;
				if(m==0) {
					m = M ;
				}
				//縦位置を求める
				int n = (num-1)/M + 1;

				if(B[i][m] == 0) {
					B[i][m] = num ;
					if(C[n][m] == 0) {
						C[n][m] = num ;
					}else {
						for(int k = 1; k <= N ; k ++) {
							if(C[n][k] == 0) {
								C[n][k] = num ;
								break ;
							}
						}
					}
				}else {
					for(int k = 1; k <= M ; k ++) {
						if(B[i][k] == 0 && C[n][k] == 0) {
							B[i][k] = num ;
							C[n][k] = num ;
							break ;
						}
					}
				}
			}
		}
		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				if(Z[i][j] != 2 ) {
					continue ;
				}
				//横に動く
				int num = A[i][j] ;
				//横位置を見つける
				int m = num % M;
				if(m==0) {
					m = M ;
				}
				//縦位置を求める
				int n = (num-1)/M + 1;

				if(B[i][m] == 0) {
					B[i][m] = num ;
					if(C[n][m] == 0) {
						C[n][m] = num ;
					}else {
						for(int k = 1; k <= N ; k ++) {
							if(C[n][k] == 0) {
								C[n][k] = num ;
								break ;
							}
						}
					}
				}else {
					for(int k = 1; k <= M ; k ++) {
						if(B[i][k] == 0 && C[n][k] == 0) {
							B[i][k] = num ;
							C[n][k] = num ;
							break ;
						}
					}
				}
			}
		}


		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				System.out.print(B[i][j] + " ");
			}
			System.out.println();
		}
		for(int i = 1 ; i <= N ; i ++) {
			for(int j = 1 ; j <= M ; j ++) {
				System.out.print(C[i][j] + " ");
			}
			System.out.println();
		}
	}
}