#include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y, z, mm[1000000], e, sum, nn[10000000];
vector<int> v;
bool b = 0;
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= 5000; i++) {
    x -= mm[i];
    if (x == 0) b = 1;
    x += nn[i];
    if (x < k || b) {
      if (i == 1) {
        x += k;
        sum += k;
        nn[i + n + m] += k;
        mm[i + n] += k;
        for (int q = 0; q < k; q++) v.push_back(i);
      } else {
        if (x == 0 || b) {
          x++;
          sum++;
          mm[i - 1 + n]++;
          nn[i - 1 + n + m]++;
          v.push_back(i - 1);
        }
        if (x < k) {
          sum += k - x;
          y = k - x;
          x += k - x;
          mm[i + n] += y;
          nn[i + m + n] += y;
          for (int q = 0; q < y; q++) v.push_back(i);
        }
      }
    }
    b = 0;
  }
  cout << sum << endl;
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  return 0;
}
