#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 1e5 + 1;
const long long mod = 1e9 + 7;
const int bits = 20;
const long double pi = 3.14159265358979323846;
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  int lim = n + m + 1;
  vector<int> workers(lim + 1, 0);
  vector<int> key(lim + 1, 0);
  int ans = k;
  vector<int> store(k, 1);
  for (int i = 1; i <= n; i++) {
    workers[i] = k;
    key[i] = 1;
  }
  workers[lim] = k;
  for (int i = 1; i <= lim; i++) {
    if (!key[i]) {
      ans++;
      store.push_back(i - 1);
      for (int j = i - 1; j <= min(lim, i - 1 + n - 1); j++) {
        key[j] = 1;
        workers[j]++;
      }
    }
    if (workers[i] < k) {
      int diff = k - workers[i];
      for (int j = i; j <= min(lim, i + n - 1); j++) {
        workers[j] += diff;
        key[j] = 1;
      }
      while (diff--) {
        store.push_back(i);
      }
    }
  }
  cout << store.size() << "\n";
  for (int x : store) {
    cout << x << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  std::cout << std::fixed << std::setprecision(20);
  ;
  long long t = 1;
  while (t--) {
    solve();
  }
}
