#include <bits/stdc++.h>
using namespace std;
int k, m, n, B[301][301];
int X[] = {0, 0, 1};
int Y[] = {1, -1, 0};
vector<vector<int>> T;
void go(int x, int y, int t) {
  B[x][y] = 1;
  T[t].push_back(x);
  T[t].push_back(y);
  if (t < k && T[t].size() == 4) {
    ++t;
  }
  for (int i = 0; i < 3; ++i) {
    x += X[i];
    y += Y[i];
    if (1 <= x && x <= n && 1 <= y && y <= m && !B[x][y]) {
      go(x, y, t);
      return;
    }
    x -= X[i];
    y -= Y[i];
  }
}
int main() {
  cin >> n >> m >> k;
  T.assign(k + 1, vector<int>());
  go(1, 1, 1);
  for (int i = 1; i <= k; ++i) {
    cout << T[i].size() / 2;
    for (auto j : T[i]) {
      cout << " " << j;
    }
    cout << endl;
  }
  return 0;
}
