#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
int n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  vector<int> a;
  for (int i = 1; i <= n + m; i += (n - 1)) {
    a.push_back(i);
    if (i != 1 && k != 1) i++;
    if (i > n + m) break;
    for (int j = 0; j < k - 1; j++) a.push_back(i);
  }
  printf("%d\n", (int)a.size());
  for (int i : a) printf("%d ", i);
  return 0;
}
