#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, ans = 1;
  cin >> n >> m >> k;
  vector<vector<pair<int, int>>> A;
  A.push_back({make_pair(1, 1)});
  queue<vector<pair<int, int>>> q;
  q.push(A[0]);
  vector<vector<bool>> vis(n + 1, vector<bool>(m + 1, 1));
  vis[1][1] = 0;
  while (!q.empty() && (int)A.size() < k) {
    auto x = q.front(), y = x;
    int sz = x.size();
    auto pa = x[sz - 1];
    if (pa.first < n && vis[pa.first + 1][pa.second] == 1) {
      vis[pa.first + 1][pa.second] = 0;
      x.push_back(make_pair(pa.first + 1, pa.second));
      A.push_back(x);
      ans += sz + 1;
      q.push(x);
    }
    if (A.size() == k) break;
    if (pa.second < m && vis[pa.first][pa.second + 1] == 1) {
      vis[pa.first][pa.second + 1] = 0;
      y.push_back(make_pair(pa.first, pa.second + 1));
      A.push_back(y);
      ans += sz + 1;
      q.push(y);
    }
    q.pop();
  }
  cout << ans << endl;
  for (int i = k - 1; i >= 0; i--) {
    for (int j = 0; j < A[i].size(); j++) {
      cout << "(" << A[i][j].first << "," << A[i][j].second << ") ";
    }
    cout << "\n";
  }
}
