#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast")
using namespace std;
const long double pi = acos(-1);
const long long int M = LLONG_MAX, N = 1e7 + 5, INF = 1e18;
void solve() {
  long long int n, m, k;
  cin >> n >> m >> k;
  vector<long long int> a;
  for (long long int i = 1; i <= k; i++) {
    a.push_back(1);
  }
  if (k == 1) {
    a.push_back(n);
    long long int cc = n + n - 1;
    for (long long int i = n + 1; i <= n + m; i++) {
      if (i == cc) {
        a.push_back(i);
        cc += n - 1;
      }
    }
  } else {
    for (long long int i = n; i <= n + m; i++) {
      if (i % n == 0) {
        a.push_back(i);
      } else if (i % n == 1 && k != 1) {
        for (long long int j = 1; j <= k - 1; j++) a.push_back(i);
      }
    }
  }
  cout << (long long int)(a).size() << "\n";
  for (auto it : a) cout << it << " ";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
