#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<int> ans;
queue<pair<int, int> > q;
int main(void) {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= k; ++i) q.push(make_pair(1, n)), ans.push_back(1);
  int date = 1;
  while (date <= m + n) {
    int x = q.front().second;
    if (x > m + n) break;
    while (!q.empty() && q.front().second <= x) q.pop();
    if (q.empty()) {
      ans.push_back(x);
      q.push(make_pair(x, x + n - 1));
    }
    date = x + 1;
    if (date > m + n) break;
    int tmp = k - (int)q.size();
    while (tmp--) {
      ans.push_back(date);
      q.push(make_pair(date, date + n - 1));
    }
  }
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < (int)ans.size(); ++i) printf("%d ", ans[i]);
  return 0;
}
