#include <bits/stdc++.h>
using namespace std;
const int N = 3000;
struct node {
  int x, y;
  int dis;
};
node p[N];
bool cmp(node a, node b) {
  if (a.dis != b.dis)
    return a.dis < b.dis;
  else if (a.x != b.x)
    return a.x < b.x;
  return a.y < b.y;
}
int main() {
  int n, m, k;
  while (cin >> n >> m >> k) {
    int cont = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        p[cont].x = i;
        p[cont].y = j;
        p[cont].dis = j + i - 1;
        cont++;
      }
    }
    sort(p, p + cont, cmp);
    int sum = 0;
    for (int i = 0; i < k; i++) sum += p[i].dis;
    cout << sum << endl;
    for (int i = k - 1; i >= 0; i--) {
      for (int xx = 1; xx <= p[i].x; xx++) printf("(%d,%d) ", xx, 1);
      for (int yy = 2; yy <= p[i].y; yy++) printf("(%d,%d) ", p[i].x, yy);
      puts("");
    }
  }
  return 0;
}
