#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, cnt = 0;
  cin >> n >> m >> k;
  if (k == 1) {
    vector<int> v;
    int p = 1;
    while (1) {
      v.push_back(p);
      if (p + n - 1 >= n + m + 1) break;
      p += n - 1;
    }
    cout << v.size() << '\n';
    for (int i = 0; i < (int)v.size(); i++) cout << v[i] << ' ';
    return 0;
  }
  long long ans = (1 + ceil((double)m / (double)n)) * k + (m % n == 0);
  cout << ans << '\n';
  for (int i = 0; i < k; i++) cout << 1 << ' ', cnt++;
  int p = n;
  while (1) {
    if (cnt >= ans) return 0;
    cout << p << ' ';
    cnt++;
    p++;
    for (int j = 0; j < k - 1; j++) {
      if (cnt >= ans) return 0;
      cout << p << ' ', cnt++;
    }
    p += n - 1;
    if (cnt >= ans) return 0;
  }
  return 0;
}
