#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;cin>>x;return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>ostream& operator<<(ostream&o,const vv<T>&v){for(auto&r:v)o<<r<<'\n';return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T1,class T2>pair<T1,T2>operator*(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi*b.fi,a.se*b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>void operator+=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi+=b.fi;a.se+=b.se;}
template<class T1,class T2>void operator-=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi-=b.fi;a.se-=b.se;}
template<class T1,class T2>void operator*=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi*=b.fi;a.se*=b.se;}
template<class T>void operator*=(pair<T,T>&a,T b){a.fi*=b;a.se*=b;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T1,class T2>void operator%=(vc<T1>&a,T2 b){for(T1&x:a)x%=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T1,class T2>void prepend(vc<T1>&a,const T2&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { cout<<"-1"<<'\n'; return;}
#define yes { cout<<"Yes"<<'\n'; return;}
#define ye { cout<<"Yes"<<'\n';}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define endl '\n'
const int di[] = {-1,0,1,0,-1,-1,1,1,0}, dj[] = {0,-1,0,1,-1,1,-1,1,0}; //^<v>


struct Solver {
  vvi solve(int h, int w, int m) {
    vvi a(h,vi(w));
    if (m == 0) return {};
    vp ps;
    rep(i,h) {
      if (i%2) {
        drep(j,w) ps.eb(i,j);
      } else {
        rep(j,w) ps.eb(i,j);
      }
    }
    if (h*w%2 && h >= 2 && w >= 2) {
      if (m*2 == h*w-1) return {};
      ps = vp();
      rep(i,h) {
        if (i%2) {
          for (int j = w-3; j >= 0; j--) ps.eb(i,j);
        } else {
          for (int j = 0; j <= w-3; j++) ps.eb(i,j);
        }
      }
      drep(i,h) {
        if (i%2) {
          for (int j = w-1; j >= w-2; j--) ps.eb(i,j);
        } else {
          for (int j = w-2; j <= w-1; j++) ps.eb(i,j);
        }
      }
    }

    int x = 1;
    for (int pi = 0; pi < m*2; pi += 2) {
      auto [i,j] = ps[pi];
      a[i][j] = x++;
    }
    srep(pi,m*2-1,h*w-1) {
      auto [i,j] = ps[pi];
      a[i][j] = x++;
    }
    for (int pi = m*2-3; pi >= 1; pi -= 2) {
      auto [i,j] = ps[pi];
      a[i][j] = x++;
    }
    a[ps.back().fi][ps.back().se] = x++;
    return a;
  }
};

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // cin >> ts;
  rep1(ti,ts) {
    Solver solver;
    int h,w,m;
    cin>>h>>w>>m;
    vvi a = solver.solve(h,w,m);
    if (sz(a) == 0) cout<<-1<<endl;
    else cout<<a<<endl;
  }

  return 0;
  rep1(h,10)rep1(w,10)rep1(m,h*w/2) {
    Solver s;
    vvi a = s.solve(h,w,m);
    if (sz(a) == 0) cout<<h<<" "<<w<<" "<<m<<" "<<-1<<endl;
    else {
      int c = 0, d = 0;
      set<int> st;
      rep(i,h)rep(j,w) {
        int cs = 0, ds = 0;
        assert(a[i][j] <= h*w);
        assert(1 <= a[i][j]);
        st.em(a[i][j]);
        rep(v,4) {
          int ni = i+di[v], nj = j+dj[v];
          if (ni<0||nj<0||ni>=h||nj>=w) continue;
          if (a[ni][nj] < a[i][j]) cs++; else ds++;
        }
        if (!cs) c++;
        if (!ds) d++;
      }
      assert(sz(st) == h*w);
      if (c != m || d != m) cout<<h<<" "<<w<<" "<<m<<" "<<"WA"<<endl;
    }
  }
  return 0;
}