#include <bits/stdc++.h>
using namespace std;
using namespace std;
#pragma comment(linker, "/STACK:167177216")
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  queue<int> q, qq;
  vector<int> ans;
  for (int i = 1; i < 4 * (n + m); ++i) {
    while (qq.size() > 0 && (i - qq.front() == m)) {
      q.push(i);
      qq.pop();
    }
    while (q.size() > 0 && (i - q.front() == n)) {
      q.pop();
      qq.push(i);
    }
    while (q.size() < k || (i - q.back() + 1 == n)) {
      q.push(i);
      ans.push_back(i);
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); ++i) cout << ans[i] << ' ';
  return 0;
}
