#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, m, k;
vector<int> v;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  if (k == 1) {
    v.push_back(1);
    for (int i = n; i < n + m + 1; i += n - 1) v.push_back(i);
    printf("%d\n", (int)(v.size()));
    for (int i = 0; i < (int)(v.size()); i++) printf("%d ", v[i]);
    return 0;
  }
  for (int i = 0; i < k; i++) v.push_back(1);
  for (int i = n; i <= n + m; i += n) {
    v.push_back(i);
    if (i + 1 <= n + m)
      for (int j = 0; j < k - 1; j++) v.push_back(i + 1);
  }
  printf("%d\n", (int)(v.size()));
  for (int i = 0; i < (int)(v.size()); i++) printf("%d ", v[i]);
  return 0;
}
