#include <bits/stdc++.h>
using namespace std;
vector<int> o;
int need[11111];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  fill(need, need + n + m + 1, k);
  for (int i = 1; i <= n + m; ++i) {
    if (need[i]) {
      for (int j = 0; j < need[i]; ++j) o.push_back(i);
      int ni = need[i];
      for (int j = 0; j < n && i + j <= n + m; ++j) need[i + j] -= ni;
    } else {
      int j = i;
      while (j <= n + m + 10 && !need[j]) ++j;
      --j;
      if (j <= n + m && !need[j]) {
        o.push_back(j);
        for (int k = 0; k < n && j + k <= n + m; ++k) need[j + k] -= 1;
      }
      i = j;
    }
  }
  if (o.back() + n - 1 <= n + m) o.push_back(n + m);
  cout << o.size() << endl;
  for (auto i : o) cout << i << ' ';
  return 0;
}
