计蒜客005-矩阵翻转

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		
		int M=in.nextInt();
		int N=in.nextInt();
		int T=in.nextInt();
	    int[][] matrix = new int[250][250];
	    int i,j;
	    
		for(i=0;i<M;i++)
			for(j=0;j<N;j++)
				matrix[j][i]=in.nextInt();
		
		if(T==0)
			for(i=0;i<M;i++){
				for(j=0;j<N;j++)
					System.out.print(matrix[N-j-1][i]+" ");
				System.out.println();
			}
		else if(T==1)
			for(i=0;i<M;i++){
				for(j=0;j<N;j++)
					System.out.print(matrix[j][M-i-1]+" ");
				System.out.println();
			}
	}

}