#include <bits/stdc++.h>
using namespace std;
int n, m, k, tot;
vector<pair<int, int> > ans;
void prt(int x, int y) { printf(" (%d,%d)", x + 1, y + 1); }
int main() {
  scanf("%d%d%d", &n, &m, &k);
  tot = 0;
  for (int i = 1; i < n + m && k > 0; i++) {
    int piece = i - max(0, i - n) - max(0, i - m);
    int det = min(piece, k);
    k -= det;
    tot += det * i;
    ans.push_back(make_pair(i, det));
  }
  printf("%d\n", tot);
  for (int i = ans.size() - 1; i >= 0; i--) {
    int det = ans[i].first - 1, mul = ans[i].second;
    int dx = min(n - 1, det), dy = det - dx;
    for (int j = 0; j < mul; j++) {
      printf("(1,1)");
      int x = 0, y = 0;
      for (int l = 0; l < dx; l++) {
        x++;
        prt(x, y);
      }
      for (int l = 0; l < dy; l++) {
        y++;
        prt(x, y);
      }
      dx--;
      dy++;
      printf("\n");
    }
  }
  return 0;
}
