#include <bits/stdc++.h>
#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
    #include <filesystem>
    namespace fs = std::filesystem;
#else
    #define DBG(X)
    #define SAY(X)
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
static mt19937 _g(time(nullptr));
 
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int H,W,N;
vector<int> A;
deque<int> color;
void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path __p = __FILE__;
        fs::path __input, __output;
        __input = __output = __p.parent_path();
        __input += string("/input/") + string(__p.stem()) + string(".txt");
        __output += string("/output/") + string(__p.stem()) + string(".txt");
        freopen(__input.c_str(), "r", stdin);
        freopen(__output.c_str(), "w", stdout);
    #endif
    cin >> H >> W >> N;
    A=fetch_vec<int>(N);
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < A[i]; j++)
        {
            color.push_back(i+1);
        }    
    }
    
}

// bool visited[110][110];
// int ans[110][110];
vector<vector<int> > ans;
vector<vector<bool> > visited;

bool isIn(int x, int y){
    return (0<=x && x<H && 0<=y && y<W);
}

void Xdfs(int i,int j){
    int c = color.front();
    color.pop_front();
    ans[i][j] = c;
    visited[i][j]=true;
    for (int k = 0; k < 4; k++)
    {
        int nx=i,ny=j;
        nx += dx[k];
        ny += dy[k];
        if(!isIn(nx,ny)) continue;
        if(visited[nx][ny]) continue;
        Xdfs(nx,ny);
        return ;
    }
}

void dfs(int i, int j){
    stack<pii> st;
    st.emplace(i,j);
    while(!st.empty()){
        pii now = st.top();
        st.pop();
        if(visited[now.first][now.second]) continue;
        visited[now.first][now.second] = true;
        int c = color.front();
        color.pop_front();
        ans[now.first][now.second] = c;
        if(color.empty()) return;
        for (int k = 0; k < 4; k++)
        {
            pii next = now;
            next.first += dx[k];
            next.second += dy[k];
            if(!isIn(next.first, next.second)) continue;
            if(visited[next.first][next.second]) continue;
            st.push(next);
        }
    }
}

int solve(){
    // memset(ans,0,sizeof(ans));
    // memset(visited,false,sizeof(ans));
    ans.assign(H,vector<int>(W,0));
    visited.assign(H,vector<bool>(W,false));
    // dfs(0,0);
    Xdfs(0,0);

    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
        {
            cout << ans[i][j] << " ";
        }
        cout << "\n";
    }
    
    return 0;
}   

int main()
{
    input();
    solve();
    return 0;
}


Measured memory_bytes: 384