#include <bits/stdc++.h>
using namespace std;
int sta[100000], ans[100000];
int main() {
  int n, m, k;
  int i, nans = 0;
  memset(sta, 0, sizeof(sta));
  cin >> n >> m >> k;
  for (i = 1; i <= k; i++) ans[++nans] = 1;
  ans[++nans] = n;
  if (k > 1)
    for (i = 2; i <= k; i++) ans[++nans] = n + 1;
  if (2 * n <= n + m)
    if (k == 1) {
      ans[++nans] = n + m - 1;
      if (n + m - 1 + n <= n + m + 1) ans[++nans] = n + m;
    } else
      ans[++nans] = n + m;
  if (k == 1 && 2 * n == n + m + 1) ans[++nans] = n + 1;
  cout << nans << endl;
  for (i = 1; i <= nans; i++) cout << ans[i] << ' ';
  cout << endl;
  return 0;
}
