#include <bits/stdc++.h>
using namespace std;
int n, m, k, flag, pos;
vector<int> vec;
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 0; i < k; i++) vec.push_back(1);
  pos = n, flag = 0;
  while (pos < 1 + n + m) {
    if (!flag) {
      vec.push_back(pos);
      flag = 1;
      pos++;
    } else {
      for (int i = 1; i < k; i++) vec.push_back(pos);
      flag = 0;
      pos += (n - 1);
      if (k == 1) pos--;
    }
  }
  printf("%d\n", vec.size());
  for (int i = 0; i < vec.size(); i++) printf("%d ", vec[i]);
  return 0;
}
