#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int hav[3000];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  if (k == 1) {
    for (int i = 1; i <= n + m; i += (n - 1)) ans.push_back(i);
  } else {
    for (int i = 0; i < k; ++i) ans.push_back(1);
    hav[0] = k;
    hav[n] = -k;
    int nxt = 0;
    for (int i = 0; i < n + m; ++i) {
      nxt += hav[i];
      if (nxt == 0) {
        nxt = 1;
        hav[i + n - 1]--;
        ans.push_back(i);
      }
      if (nxt < k) {
        int need = k - nxt;
        nxt = k;
        for (int j = 0; j < need; ++j) ans.push_back(i + 1);
      }
    }
  }
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); ++i)
    printf("%d%c", ans[i], " \n"[i == ans.size() - 1]);
  return 0;
}
