#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
  int i;
  for (i = 0; i < rep; i++) p[i] = val;
}
signed long long GETi() {
  signed long long i;
  scanf("%lld", &i);
  return i;
}
int H, W, K;
void solve() {
  int f, i, j, k, l, x, y;
  cin >> H >> W >> K;
  int r = 0;
  vector<pair<int, int> > V;
  for (l = 1; l <= H + W - 1; l++) {
    for (y = 0; y < H; y++) {
      int x = (l - 1) - y;
      if (x < 0 || x >= W) continue;
      if (K-- == 0) goto out;
      r += l;
      V.push_back(make_pair(x, y));
    }
  }
out:
  (void)printf("%d\n", r);
  for (i = 0; i < V.size(); i++) {
    int tx = V[V.size() - 1 - i].first + 1;
    int ty = V[V.size() - 1 - i].second + 1;
    x = 1;
    y = 1;
    while (y < ty) (void)printf("(%d,%d) ", y, x), y++;
    while (x <= tx) (void)printf("(%d,%d) ", y, x), x++;
    (void)printf("\n");
  }
}
int main(int argc, char** argv) {
  string s;
  if (argc == 1) ios::sync_with_stdio(false);
  for (int i = 1; i < argc; i++) s += argv[i], s += '\n';
  for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin);
  solve();
  return 0;
}
