#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
int ans[maxn * maxn], x[maxn * 5];
int main() {
  int n, m, k;
  int a, b;
  scanf("%d%d%d", &n, &m, &k);
  int num = 0;
  for (int i = 1; i <= k; i++) ans[num++] = 1;
  for (int i = 1; i <= n; i++) x[i] = k;
  int z;
  for (int i = n + 1; i <= m + n; i++) {
    if (!x[i]) {
      ans[num++] = i - 1;
      for (int j = i - 1; j < i - 1 + n; j++) x[j]++;
    }
    if (x[i] < k) {
      z = k - x[i];
      for (int j = 1; j <= z; j++) ans[num++] = i;
      for (int j = i; j < i + n; j++) x[j] += z;
    }
  }
  if (x[n + m + 1] == 0) ans[num++] = n + m;
  printf("%d\n", num);
  for (int i = 0; i < num - 1; i++) printf("%d ", ans[i]);
  printf("%d\n", ans[num - 1]);
}
