#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> employes;
  int go[6000];
  memset(go, 0, sizeof go);
  for (int i = 0; i < n; i++) go[1 + i] += k;
  for (int i = 0; i < k; i++) employes.push_back(1);
  for (int i = n; i <= n + m; i++) {
    if (go[i + 1] == 0 && go[i] >= k) {
      employes.push_back(i);
      for (int j = 0; j < n; j++) go[i + j]++;
    } else if (go[i] < k) {
      int u = k - go[i];
      for (int x = 0; x < k - go[i]; x++) employes.push_back(i);
      for (int j = 0; j < n; j++) go[i + j] += u;
    }
  }
  cout << employes.size() << endl;
  for (int i = 0; i < employes.size(); i++) cout << employes[i] << " ";
  cout << endl;
  return 0;
}
