## implementation

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define ALL(x) begin(x), end(x)
using namespace std;
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
template <typename T> ostream & operator << (ostream & out, vector<T> const & xs) { REP (i, int(xs.size()) - 1) out << xs[i] << ' '; if (not xs.empty()) out << xs.back(); return out; }

vector<int> get_invertion_number_inv(int n, int k) {
vector<int> a(n);
iota(ALL(a), 0);
vector<int> b;
REP (i, n) {
int j = min<int>(k, a.size() - 1);
k -= j;
b.push_back(a[j]);
a.erase(a.begin() + j);
}
return b;
}

int main() {
// input
int h, w, k; cin >> h >> w >> k;

// solve
int ky = min(k, h * (h - 1) / 2 * w) / w;
k -= w * ky;
vector<int> cy = get_invertion_number_inv(h, ky);
auto c = vectors(h, w, int());
REP (y, h) {
int kx = min(k, w * (w - 1) / 2);
k -= kx;
vector<int> cx = get_invertion_number_inv(w, kx);
REP (x, w) {
c[y][x] = cy[y] * w + cx[x] + 1;
}
}
assert (k == 0);

// output
REP (y, h) {
cout << c[y] << endl;
}
return 0;
}