#include <bits/stdc++.h>
using namespace std;
int t[2000001], d[2000001], add[2000001], n, a[2000000], m, k, ans, i, j;
int main() {
  cin >> n >> m >> k;
  for (i = 1; i <= 2000000; i++) {
    t[i] = t[i - 1] - d[i] + add[i];
    if (t[i] - d[i + 1] == 0) {
      t[i]++;
      if (i + n + m > 2000000) break;
      d[i + n]++;
      add[i + n + m]++;
      ans++;
      a[ans] = i;
    }
    if (t[i] < k) {
      if (i + n + m > 2000000) break;
      d[i + n] += k - t[i];
      add[i + n + m] += k - t[i];
      for (j = ans + 1, ans += k - t[i]; j <= ans; j++) {
        a[j] = i;
      }
      t[i] += k - t[i];
    }
  }
  printf("%d\n", ans);
  for (i = 1; i <= ans; ++i) {
    printf("%d ", a[i]);
  }
  printf("\n");
  return 0;
}
