#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<int> v;
void solve() {
  if (k == 1) {
    for (int i = 0; 1 + i * (n - 1) <= n + m; i++) v.push_back(1 + i * (n - 1));
    return;
  }
  for (int i = 1; i <= k; i++) v.push_back(1);
  v.push_back(n);
  for (int i = 1; i < k; i++) v.push_back(n + 1);
  if (n == m) v.push_back(2 * n);
}
int main() {
  scanf("%d %d %d", &n, &m, &k);
  solve();
  printf("%d\n", v.size());
  for (int i = 0; i < v.size(); i++)
    printf("%d%c", v[i], i < v.size() - 1 ? ' ' : '\n');
  return 0;
}
