static void Print(Integer k, int m, int n, int[][] matrix) {
		
		/*
		 *  Why?
		 */
		if(m-2*k == 1) {
			for(int i = k ; i <= n-1-k; ++i)
				System.out.println(matrix[i][k]);
		}
		else if(n-2*k == 1) {
			for(int i = k ; i <= m-1-k; ++i)
				System.out.println(matrix[k][i]);
		}
		
		else {
			// from top-left to top-right
			for(int i = k; i<=m-k-1; ++i) {
				System.out.println(matrix[k][i]);
			}
			// from top-right to bot-right
			for(int i = k+1; i <= n-k-1; ++i) {
				System.out.println(matrix[i][m-k-1]);
			}
			// from bot-right to bot-left
			for(int i = k+1; i <= m-k-1; ++i) {
				System.out.println(matrix[n-k-1][m-i-1]);
			}
			// from bot-left to top-left
			for(int i = k+1; i <= n-k-2; ++i) {
				System.out.println(matrix[n-i-1][k]);
			}
		}
	}