Problem: 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.

Examples

Input

2 2
3
2 1 1


Output

1 1
2 3


Input

3 5
5
1 2 3 4 5


Output

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


Input

1 1
1
1


Output

1

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
int ans[200][200];
int main()
{
	int H,W,n,i,a,t;
	scanf("%d%d%d",&H,&W,&n);
 	int h=1,w=1; 
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a);
		while(a)
		{
		ans[h][w]=i;
		if(h%2!=0)
		{
			if(w!=W)
				w++;
			else
				h++;
		}
		else
		{
			if(w!=1)
				w--;
			else
				h++;
		}
		a--;
	    }
	}
	for(h=1;h<=H;h++)
	{
		for(w=1;w<=W;w++)
			printf("%d ",ans[h][w]);
		printf("\n");
	}
	return 0;
}