#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
int ar[3000];
vector<int> vec;
int main() {
  int i, j, n, k, m, r, sz;
  cin >> n >> m >> k;
  for (i = 1; i <= n + m; i++) {
    if (ar[i] < k) {
      r = k - ar[i];
      for (j = 1; j <= n; j++) {
        ar[i + j - 1] += r;
      }
      for (j = 1; j <= r; j++) {
        vec.push_back(i);
      }
    }
    if (ar[i + 1] == 0) {
      vec.push_back(i);
      for (j = 1; j <= n; j++) {
        ar[j + i - 1] += 1;
      }
    }
  }
  sz = vec.size();
  cout << sz << endl;
  for (i = 0; i < sz; i++) {
    cout << vec[i] << " ";
  }
  cout << endl;
  return 0;
}
