#include <bits/stdc++.h>
using namespace std;
const int N = 1100;
const int MAXN = int(1e6) + 100;
const long long mod = int(1e9) + 7;
int solution();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  return solution();
}
int n, m, k, a[MAXN];
vector<int> ans;
int solution() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) a[i] = k;
  for (int i = 1; i <= k; i++) ans.push_back(1);
  int cur = 1;
  while (cur <= n + m) {
    if (a[cur] < k || a[cur + 1] == 0) {
      ans.push_back(cur);
      for (int i = cur; i < cur + n; i++) a[i]++;
    } else {
      cur++;
    }
  }
  cout << ans.size() << endl;
  for (auto cur : ans) cout << cur << ' ';
  return 0;
}
