#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:134217728")
using namespace std;
int cnt[1 << 14];
int add[1 << 14];
int del[1 << 14];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> res;
  int now = 0;
  for (int i = 1; i <= 2 * (n + m); ++i) {
    now -= del[i];
    if (now == 0 && i > 1) {
      res.push_back(i - 1);
      now++;
      del[i + n - 1]++;
      add[i + n + m - 1]++;
      del[i + 2 * n + m - 1]++;
    }
    now += add[i];
    int need = max(0, k - now);
    for (int j = 0; j < need; ++j) res.push_back(i);
    del[i + n] += need;
    add[i + n + m] += need;
    del[i + 2 * n + m] += need;
    now += need;
  }
  sort(res.begin(), res.end());
  cout << res.size() << endl;
  for (int i = 0; i < res.size(); ++i) cout << res[i] << " ";
  cout << endl;
  return 0;
}
