#include <bits/stdc++.h>
using namespace std;
bool viz[100][100];
vector<pair<int, int>> d[150];
int n, m;
void print_location(int x, int y);
void parc(int x, int y, int l);
int main() {
  int k, l = 1, penal = 0;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) viz[i][j] = 1;
  parc(1, 1, 1);
  while (d[l].size() <= k) {
    penal += d[l].size() * l;
    k -= d[l].size();
    l++;
  }
  penal += l * k;
  cout << penal << '\n';
  for (int i = 0; i < k; i++) {
    print_location(d[l][i].first, d[l][i].second);
    cout << '\n';
  }
  for (int i = l - 1; i >= 1; --i) {
    for (auto q : d[i]) {
      print_location(q.first, q.second);
      cout << '\n';
    }
  }
  return 0;
}
void parc(int x, int y, int l) {
  viz[x][y] = 0;
  d[l].push_back({x, y});
  if (viz[x + 1][y]) parc(x + 1, y, l + 1);
  if (viz[x][y + 1]) parc(x, y + 1, l + 1);
}
void print_location(int x, int y) {
  if (x > 1)
    print_location(x - 1, y);
  else if (y > 1)
    print_location(x, y - 1);
  cout << " (" << x << ',' << y << ')';
}
