Matrix Traversal & Queries

Description

You are given a matrix of size n x m , and two types of queries are to be performed on this matrix. The two types of queries are

q = 1, for this type of query, the matrix is to be traversed, as shown in Fig. 1

q = 2, for this type of query, the matrix is to be traversed as shown in Fig. 2

Input

The first line of input contains T, the number of test case. The first line of each test case contains n, m and q, as declared in the problem statement.

Next n lines contain space separated integers, denoting the values of the matrix.

Constraints

1 <= T <= 10

1 <= N,M <= 500

1 <= A[i][j] <= 1000

Output

Print n x m space separated integers, denoting the elements of the matrix, on a new line.

Sample Input 1 

2
3 3 1
1 2 3
4 5 6
7 8 9
3 3 2
1 2 3
4 5 6
7 8 9

Sample Output 1

1 2 3 6 5 4 7 8 9 
3 2 1 4 5 6 9 8 7 

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner sc =  new Scanner(System.in);

        int times = sc.nextInt();

        for (int run =0;run<times;run++){

            int row = sc.nextInt();

            int col = sc.nextInt();

            int q = sc.nextInt();

            int [][]matrix = new int[row][col];

            for (int i = 0;i<row;i++){

                for (int j = 0;j<col;j++){

                    matrix[i][j]= sc.nextInt();

                }

            }

            if (q%2!=0){

                for (int i = 0;i<row;i++){

                    for (int j = 0;j<col;j++){

                        if (i%2==0){

                            System.out.print(matrix[i][j]+" ");

                        }else {

                            System.out.print(matrix[i][col-j-1]+" ");

                        }

                    }

                }

            }else {

                for (int i = 0;i<row;i++){

                    for (int j = 0;j<col;j++){

                        if (i%2!=0){

                            System.out.print(matrix[i][j]+" ");

                        }else {

                            System.out.print(matrix[i][col-j-1]+" ");

                        }

                    }

                }

            }

            System.out.println();

        }

    }

}