#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, k;
vector<pair<int, vector<pair<int, int> > > > ans;
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      vector<pair<int, int> > ret;
      for (int y = 1; y <= j; y++) ret.push_back(make_pair(1, y));
      for (int x = 2; x <= i; x++) {
        ret.push_back(make_pair(x, j));
      }
      ans.push_back(make_pair(i + j, ret));
    }
  }
  sort(ans.begin(), ans.end());
  int ret = 0;
  for (int i = 0; i < k; i++) {
    ret += ans[i].second.size();
  }
  cout << ret << endl;
  for (int i = k - 1; i >= 0; i--) {
    vector<pair<int, int> > t = ans[i].second;
    for (int j = 0; j < t.size(); j++) {
      cout << "(" << t[j].first << "," << t[j].second << ") ";
    }
    cout << endl;
  }
  return 0;
}
