// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

int h, w;
int n;
int[] a;

void main() {
    scan(h, w);
    scan(n);
    a = readln.split.to!(int[]);

    auto c = new int[][](h, w);

    int y, x;
    bool sw;

    foreach (i, ai ; a) {
        while (ai--) {
            c[y][x] = i + 1;

            if (sw) {
                x--;
                if (x < 0) {
                    x = 0;
                    y++;
                    sw = false;
                }
            }
            else {
                x++;
                if (x == w) {
                    x = w - 1;
                    y++;
                    sw = true;
                }
            }
        }
    }

    writefln("%(%(%s %)\n%)", c);
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}