#include <bits/stdc++.h>
int ans[1001000];
int use[5000];
int main() {
  int n, m, k;
  int i, j, size = 0;
  scanf("%d%d%d", &n, &m, &k);
  memset(use, 0, sizeof(use));
  for (i = 1; i <= m + n; i++) {
    while (use[i] < k || ans[size - 1] + n - 1 == i) {
      ans[size++] = i;
      for (j = i; j <= i + n - 1; j++) use[j]++;
    }
  }
  printf("%d\n", size);
  for (i = 0; i < size; i++)
    printf("%d%c", ans[i], (i == size - 1) ? '\n' : ' ');
  return 0;
}
