#include <bits/stdc++.h>
using namespace std;
int a[10000];
int i, j, n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  a[1] = k;
  int num = k;
  for (i = 2; i <= n + m; i++) {
    if (i == 2) puts("");
    num -= (i - n >= 1) ? a[i - n] : 0;
    if ((num - ((i - n + 1 >= 1) ? a[i - n + 1] : 0)) < 1) a[i]++;
    if (num + a[i] <= k) {
      a[i] += (k - num - a[i]);
    }
    num += a[i];
  }
  int ans = 0;
  for (i = 1; i <= n + m; i++) ans += a[i];
  printf("%d\n", ans);
  for (i = 1; i <= n + m; i++) {
    for (int j = 1; j <= a[i]; j++) printf("%d ", i);
  }
  return 0;
}
