#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
vector<int> vec;
int main() {
  int n, m, k, ans, i, j, r, r1, sz;
  cin >> n >> m >> k;
  for (i = 1; i <= k; i++) {
    vec.push_back(1);
  }
  int next = n + m + 1, last;
  r = n;
  while (1) {
    vec.push_back(r);
    if (next == r + 1) break;
    for (i = 1; i < k; i++) {
      vec.push_back(r + 1);
    }
    if (k != 1) r1 = r + n;
    r = r + n - 1;
    if (next <= r) break;
    if (next <= r1 && k != 1) {
      break;
    }
    if (k != 1) r = r1;
  }
  sz = vec.size();
  cout << sz << endl;
  for (i = 0; i < sz; i++) cout << vec[i] << " ";
  cout << endl;
  return 0;
}
