Description
You are given a n x m matrix a. Each time you can rotate it 90 degrees in clockwise direction.
For example, let's consider a is a 3 x 2 matrix where 
.
After we rotate it once, it will become a' where 
.
Your task is to rotate a for q times.
Input
The first line contains two integer n, m (1 ≤ n, m ≤ 100) – the number of rows and the number columns in matrix a.
The following n lines contain m integers each, the j-th element in the i-th line is aij (1 ≤ aij ≤ 109).
Next line contain a integer q (1 ≤ q ≤ 109) – the times you have to rotate a.
Output
Output a after rotating it for q times.
There must be exactly a space between all the adjacent numbers in the same row.
And print a newline('\n') at the end of each line.
Remember not to print any space at the end of any line.