#include <bits/stdc++.h>
using namespace std;
const double INF = 1e20;
const double eps = 1e-6;
int n, m, k, res;
vector<int> v;
int main() {
  int i, j;
  scanf("%d%d%d", &n, &m, &k);
  if (k == 1) {
    res = k + (m + 1) / (n - 1);
    if ((m + 1) % (n - 1)) res++;
    printf("%d\n", res);
    for (i = 1; i <= k; i++) {
      printf("1 ");
    }
    int pos = n;
    for (int i = k + 1; i < res; i++) {
      printf("%d ", pos);
      pos += n - 1;
    }
    printf("%d\n", pos);
  } else {
    res = k;
    v.clear();
    i = k;
    while (i--) v.push_back(1);
    int pos = n;
    while (pos < n + m + 1) {
      v.push_back(pos);
      pos++;
      res++;
      if (pos < n + m + 1) {
        i = k - 1;
        while (i--) v.push_back(pos);
        res += k - 1;
      }
      pos += n - 1;
    }
    printf("%d\n", res);
    for (i = 0; i < v.size() - 1; i++) printf("%d ", v[i]);
    printf("%d\n", v[i]);
  }
  return 0;
}
