#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      result *= a;
    }
    a *= a;
    b /= 2;
  }
  return result;
}
long long gcd(long long x, long long y) {
  long long r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
long long countSetBits(long long x) {
  long long Count = 0;
  while (x > 0) {
    if (x & 1) Count++;
    x = x >> 1;
  }
  return Count;
}
bool isPerfectSquare(long long n) {
  long long sr = sqrt(n);
  if (sr * sr == n)
    return true;
  else
    return false;
}
long long mod(long long x, long long M) { return ((x % M + M) % M); }
long long add(long long a, long long b, long long M) {
  return mod(mod(a, M) + mod(b, M), M);
}
long long mul(long long a, long long b, long long M) {
  return mod(mod(a, M) * mod(b, M), M);
}
long long powerM(long long a, long long b, long long M) {
  long long res = 1;
  while (b) {
    if (b % 2 == 1) {
      res = mul(a, res, M);
    }
    a = mul(a, a, M);
    b /= 2;
  }
  return res;
}
long long modInverse(long long n, long long M) { return powerM(n, M - 2, M); }
long long nCrM(long long n, long long r, long long M) {
  if (n < r) return 0;
  if (r == 0) return 1;
  vector<long long> fact(n + 1);
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = mul(fact[i - 1], i, M);
  }
  return mul(mul(fact[n], modInverse(fact[r], M), M),
             modInverse(fact[n - r], M), M);
}
void incr(pair<long long, long long> &p, long long m, long long &mv) {
  if (mv == 0) {
    if (p.second == m - 1) {
      p.first++;
      mv = 1;
    } else {
      p.second++;
    }
  } else {
    if (p.second == 0) {
      p.first++;
      mv = 0;
    } else {
      p.second--;
    }
  }
}
void solve() {
  long long n, m, k;
  cin >> n >> m >> k;
  long long op = n * m;
  long long ans = floor((long double)op / k);
  vector<vector<pair<long long, long long>>> f(k);
  pair<long long, long long> curr = {0, 0};
  long long move = 0;
  for (long long i = 0; i < k; i++) {
    for (long long j = 0; j < ans; j++) {
      f[i].push_back(curr);
      incr(curr, m, move);
    }
  }
  while (curr.first < n) {
    f.back().push_back(curr);
    incr(curr, m, move);
  }
  for (long long i = 0; i < f.size(); i++) {
    cout << f[i].size() << " ";
    for (long long j = 0; j < f[i].size(); j++) {
      cout << f[i][j].first + 1 << " " << f[i][j].second + 1 << " ";
    }
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  solve();
  return 0;
}
