#include <bits/stdc++.h>
using namespace std;
long double pi = 3.14159265358979323;
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  vector<int> a(100000, 0);
  vector<int> ans;
  for (int i = 0; i < (int)n + m; ++i) {
    if (a[i] < k) {
      for (int j = 0; j < (int)k - a[i]; ++j) ans.push_back(i);
      int t = a[i];
      for (int j = i; j < n + i; ++j) a[j] += k - t;
    } else if (a[i + 1] == 0) {
      for (int j = i; j < n + i; ++j) a[j]++;
      ans.push_back(i);
    }
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < (int)ans.size(); ++i) {
    printf("%d ", ans[i] + 1);
  }
  return 0;
}
