#include <bits/stdc++.h>
using namespace std;
int n, m, q;
const int maxn = 1001;
const int maxm = 1001;
int leave[maxn + maxm];
vector<int> start;
int em[maxn + maxm];
int emc = 0;
int working = 0;
inline void hire(int i) {
  start.push_back(i);
  ++emc;
  ++leave[i + n];
  ++working;
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n + m; ++i) {
    working -= leave[i];
    leave[i] = 0;
    while (working < q) hire(i);
    if (!(working - leave[i + 1])) {
      hire(i);
    }
  }
  printf("%d\n", emc);
  for (int i = 0; i != emc; ++i)
    printf(i == emc - 1 ? "%d\n" : "%d ", start[i]);
  return 0;
}
