#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
const double PI = acos(-1);
const int X[] = {1, -1, 0, 0};
const int Y[] = {0, 0, 1, -1};
const int mod = 1e9 + 7;
int n, m, k, us[55][55], out[55][55];
vector<pair<int, int>> ans;
void get() {
  reverse(ans.begin(), ans.end());
  int penalty = 0;
  for (int i = 0; i < ans.size(); i++) {
    penalty += (ans[i].first - 1) + (ans[i].second - 1);
  }
  cout << penalty + ans.size() << "\n";
  for (int i = 0; i < ans.size(); i++) {
    int x = 1, y = 1;
    for (; x <= ans[i].first; x++) {
      cout << '(' << x << ',' << y << ')' << " ";
      out[x][y] = 1;
    }
    --x;
    for (; y <= ans[i].second; y++) {
      if (out[x][y]) {
        continue;
      }
      cout << '(' << x << ',' << y << ')' << " ";
    }
    cout << "\n";
  }
}
int main() {
  cin >> n >> m >> k;
  while (k--) {
    int mn = INF, pi, pj;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        if (us[i][j]) {
          continue;
        }
        if (mn > (i - 1) + (j - 1)) {
          mn = (i - 1) + (j - 1);
          pi = i;
          pj = j;
        }
      }
    }
    us[pi][pj] = 1;
    ans.push_back({pi, pj});
  }
  get();
  return 0;
}
