#include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<int> ans;
int a[10009];
bool c[10009];
int main() {
  scanf("%d %d %d", &n, &m, &k);
  c[1] = 1;
  for (int i = 1; i < 10009; i++) {
    while (!c[i] || a[i] < k) {
      int s = 0;
      if (!c[i])
        s = i - 1;
      else
        s = i;
      ans.push_back(s);
      c[i] = 1;
      for (int j = s; j < 10009; j += (n + m)) {
        for (int z = 0; z < n && (j + z < 10009); z++) {
          a[j + z]++;
          if (z > 0) c[j + z] = 1;
        }
      }
    }
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++) {
    printf("%d ", ans[i]);
  }
  puts("");
  return 0;
}
