#include <bits/stdc++.h>
using namespace std;
int n, m, k, tot, len;
int a[60][60];
vector<pair<int, int> > vec;
vector<pair<int, int> > ans[3600];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  int tmpk = k;
  for (int sum = 2; sum <= n + m && tmpk; sum++) {
    for (int i = 1; i <= n && tmpk > 0; i++) {
      int j = sum - i;
      if (j >= 1 && j <= m) {
        tmpk--;
        a[i][j] = 1;
        vec.push_back(pair<int, int>(i, j));
      }
    }
  }
  reverse(vec.begin(), vec.end());
  for (int i = 0; i < vec.size(); i++) {
    int x = vec[i].first;
    int y = vec[i].second;
    for (int j = 1; j <= y; j++) ans[i].push_back(pair<int, int>(1, j)), tot++;
    for (int j = 2; j <= x; j++) ans[i].push_back(pair<int, int>(j, y)), tot++;
  }
  printf("%d\n", tot);
  for (int i = 0; i < vec.size(); i++) {
    for (int j = 0; j < ans[i].size(); j++)
      printf("(%d,%d) ", ans[i][j].first, ans[i][j].second);
    printf("\n");
  }
}
