import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long H, W;
    scan(H, W);
    long N = lread();
    auto A = aryread();
    long i;
    auto T = new long[](H * W);
    foreach (j, a; A)
    {
        foreach (_; 0 .. a)
            T[i++] = j + 1;
    }
    foreach (j; 0 .. H)
    {
        if (j & 1)
        {
            foreach_reverse (k; 1 .. W)
            {
                write(T[j * W + k], " ");
            }
            writeln(T[j * W]);
        }
        else
        {
            foreach (k; 0 .. W - 1)
            {
                write(T[j * W + k], " ");
            }
            writeln(T[(j + 1) * W - 1]);
        }
    }
}
