#include <bits/stdc++.h>
using namespace std;
int n, m, k, u, ans;
vector<pair<int, int> > V[2999];
pair<int, int> s[2999];
int p;
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = (2); i <= (n + m); i++)
    for (int j = (1); j <= (i - 1); j++) {
      int x = j, y = i - j;
      if (x <= n && y <= m) {
        s[++u] = make_pair(x, y);
        ans += x + y - 1;
        for (int xx = (1); xx <= (x); xx++) V[u].push_back(make_pair(xx, 1));
        for (int yy = (2); yy <= (y); yy++) V[u].push_back(make_pair(x, yy));
        if (k == u) goto end;
      }
    }
end:;
  printf("%d\n", ans);
  for (int i = (k); i >= (1); i--)
    for (int j = (0); j <= ((int)V[i].size() - 1); j++) {
      printf("(%d,%d)%c", V[i][j].first, V[i][j].second,
             j == (int)V[i].size() - 1 ? '\n' : ' ');
    }
  return 0;
}
