#include <bits/stdc++.h>
using namespace std;
const int N = 3000;
pair<int, int> a[N];
int n, m, k;
bool comp(pair<int, int> a, pair<int, int> b) {
  if (a.first + a.second == b.first + b.second)
    return a.first < b.first;
  else
    return a.first + a.second < b.first + b.second;
}
void prepare() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) a[m * (i - 1) + j] = pair<int, int>(i, j);
  sort(a + 1, a + m * n + 1, comp);
}
void solve() {
  int ans = 0;
  for (int i = 1; i <= k; i++) ans += a[i].first + a[i].second - 1;
  printf("%d\n", ans);
  for (int i = k; i >= 1; i--) {
    for (int j = 1; j <= a[i].first; j++) printf("(%d,1) ", j);
    for (int j = 2; j <= a[i].second; j++) printf("(%d,%d) ", a[i].first, j);
    printf("\n");
  }
}
int main() {
  prepare();
  solve();
}
