import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int h, w, n;
    scan(h, w);
    scan(n);
    auto a = readArr!(int)();
    auto ans = new int[](h * w);
    int num = 1;
    foreach (i ; 0 .. h * w) {
        if (a.front == 0) {
            a.popFront();
            num++;
        }
        ans[i] = num;
        a.front -= 1;
    }
    debug {
        writeln(ans);
    }
    foreach (i ; 0 .. h) {
        auto line = ans[w*i .. w*i + w];
        writefln("%(%s %)", i % 2 ? line.retro.array : line);
    }
}





void yes(bool b) {writeln(b ? "Yes" : "No");}
void YES(bool b) {writeln(b ? "YES" : "NO");}
T[] readArr(T)() {return readln.split.to!(T[]);}

void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    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);
        }
    }
}
