#include <bits/stdc++.h>
using namespace std;
int n, m, k;
bool fuck[55][55];
int qx[3005], qy[3005];
int tot = 0;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  int ans = 0;
  for (int i = 2; i <= n + m; i++) {
    if (!k) break;
    for (int j = 1; j <= n; j++)
      if (i - j > 0 && i - j <= m) {
        if (!k) break;
        k--;
        fuck[j][i - j] = 1;
        ans += i - 1;
        ++tot;
        qx[tot] = j;
        qy[tot] = i - j;
      }
  }
  printf("%d\n", ans);
  for (int i = tot; i >= 1; i--) {
    for (int j = 1; j <= qx[i]; j++) printf("(%d,1) ", j);
    for (int j = 2; j <= qy[i]; j++) printf("(%d,%d) ", qx[i], j);
    printf("\n");
  }
  return 0;
}
