#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<int> res;
vector<int>::iterator it;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= k; ++i) res.push_back(1);
  for (int j = n + 1; j <= n + m; j += n)
    for (int i = 1; i < k; ++i) res.push_back(j);
  if (k > 1)
    for (int j = n; j <= n + m; j += n) res.push_back(j);
  else
    for (int j = n; j <= n + m; j += n - 1) res.push_back(j);
  sort(res.begin(), res.end());
  printf("%d\n", int(res.size()));
  for (it = res.begin(); it != res.end(); ++it) printf("%d ", *it);
  return 0;
}
