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: Wrong Answer)

import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try (Scanner scan = new Scanner(System.in)) {

			int H = scan.nextInt();
			int W = scan.nextInt();
			int N = scan.nextInt();

			int[] a = new int[N];
			GM[][] map = new GM[H][W];
			for (int i = 0; i < H; i++) {
				for (int j = 0; j < W; j++) {
					map[i][j] = new GM(i , j );

				}
			}
			for (int i = 0; i < N; i++) {
				a[i] = scan.nextInt();
			}

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

				int sy = 0;
				int sx = 0;

				outside: for (int j = 0; j < H; j++) {
					for (int z = 0; z < W; z++) {
						if (map[j][z].se == false) {
							sy = j;
							sx = z;
							break outside;
						}
					}
				}

				//System.out.println(sy + " " + sx);

				int irocount = a[i];

				Deque<GM> que = new ArrayDeque<GM>();
				que.addFirst(map[sy][sx]);
				map[sy][sx].se = true;
				map[sy][sx].num = i + 1;
				irocount--;
				if (irocount == 0)
					continue;

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

				outside: while (!que.isEmpty()) {
					GM p = que.removeLast();
					for (int j = 0; j < 4; j++) {
						int Y = p.y + dy[j];
						int X = p.x + dx[j];
						if (0 <= Y && Y < H && 0 <= X && X < W) {
							if (map[Y][X].se == false) {
								que.addFirst(map[Y][X]);
								//System.out.println("追加 " + Y + " " + X);
								map[Y][X].se = true;
								map[Y][X].num = i + 1;
								irocount--;
								if (irocount == 0)
									break outside;
							}
						}

					}

				}

			}

			for (int i = 0; i < H; i++) {
				for (int j = 0; j < W; j++) {
					System.out.print(map[i][j].num);
					System.out.print(" ");
				}
				System.out.println();
			}

		}

	}

	static class GM {
		int y;
		int x;
		boolean se;
		int num;

		GM(int Y, int X) {
			y = Y;
			x = X;
		}

	}

}