Problem:
Score : 400 points

Problem Statement

We have a grid with H rows and W columns of squares.
Snuke is painting these squares in colors 1, 2, ..., N.
Here, the following conditions should be satisfied:

For each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.

For each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.

Find a way to paint the squares so that the conditions are satisfied.
It can be shown that a solution always exists.

Constraints

1 ≤ H, W ≤ 100

1 ≤ N ≤ H W

a_i ≥ 1

a_1 + a_2 + ... + a_N = H W

Input

Input is given from Standard Input in the following format:

H W
N
a_1 a_2 ... a_N

Output

Print one way to paint the squares that satisfies the conditions.
Output in the following format:

c_{1 1} ... c_{1 W}
:
c_{H 1} ... c_{H W}

Here, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.

Sample Input 1

2 2
3
2 1 1

Sample Output 1

1 1
2 3

Below is an example of an invalid solution:

1 2
3 1

This is because the squares painted in Color 1 are not 4-connected.

Sample Input 2

3 5
5
1 2 3 4 5

Sample Output 2

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

Sample Input 3

1 1
1
1

Sample Output 3

1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

class Main{


	static	int[][] map;
	static int[] a;
	static int[] b;
	static	int H ;
	static	int W ;


	public static void main(String[] args) {


		Scanner sc = new Scanner(System.in);			//文字の入力
		H = sc.nextInt();
		W = sc.nextInt();
		int N = sc.nextInt();
		a = new int[N];
		map = new int[H][W];

		b = new int[N];
		int[][] test = new int[H][W];


		for(int i = 0;i < N;i++){
			a[i] = sc.nextInt();
		}
		//Arrays.sort(a);

		for(int i = 0;i < N;i++){
			test[0][0] = i+1;
			b[i]++;
			dfs(i,test,0,0,1);
			test[0][0] = 0;
			b[i]--;


		}





	}

	static void dfs(int nowcolor,int[][] test,int y,int x,int count){

//		System.out.println("y " + y+" x "+x + " color "+nowcolor + " count "+count);
//		for(int i = 0;i < H;i++){
//			for(int j = 0;j < W;j++){
//				System.out.print(test[i][j]);
//			}
//			System.out.println();
//
//		}

		if(count == H*W){			//全部塗り終わったら終了
			for(int i = 0;i < H;i++){
				for(int j = 0;j < W;j++){
					System.out.print(test[i][j]);
					System.out.print(" ");

				}
				System.out.println();
			}
			System.exit(0);					//終了	
		}

		int[] dx = {-1,1,0,0};
		int[] dy =  {0,0,1,-1};

		for(int i = 0;i < 4;i++){
			int nx = x + dx[i];
			int ny = y + dy[i];

			if(b[nowcolor] >= a[nowcolor]){				//現在の色が条件数濡れていたら次の色に行く.
				nowcolor++;
			}

			if(nx >= 0 && nx <= W-1 && ny >= 0 && ny <= H-1 &&  test[ny][nx] == 0){						//まだ塗ってなかったら、塗る
				b[nowcolor]++;
				test[ny][nx] = nowcolor+1;
				count++;
				dfs(nowcolor, test, ny, nx, count);
				count--;
				b[nowcolor]--;
			}
		}

		return;




	}

}