#include <bits/stdc++.h>
using namespace std;
int D[250], Put[250], N, M, K;
int main() {
  cin >> N >> M >> K;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= M; j++) {
      int d = i - 1 + j - 1;
      D[d]++;
    }
  int ans = 0;
  for (int i = 0; i <= N + M - 2; i++) {
    Put[i] = min(D[i], K - D[i - 1]);
    ans += Put[i] * (i + 1);
    D[i] = D[i - 1] + D[i];
    if (D[i] >= K) break;
  }
  cout << ans << "\n";
  for (int i = N + M - 2; i >= 0; i--) {
    int rem = Put[i];
    int x = min(N, i + 1);
    int y = i - (x - 1) + 1;
    while (rem) {
      for (int p = 1; p < y; p++) cout << "(" << 1 << "," << p << ") ";
      for (int p = 1; p < x; p++) cout << "(" << p << "," << y << ") ";
      cout << "(" << x << "," << y << ")\n";
      x--, y++, rem--;
    }
  }
}
