#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double pi = acos(-1);
const double EPS = 1e-9;
long long binpowmod(long long a, long long b) {
  a %= MOD;
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ret % MOD;
}
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
const int N = 1 << 18;
const int E = N * 2;
class UnionFind {
 public:
  vector<int> p, rank, setSize;
  int numSets;
  UnionFind(int N) {
    setSize.assign(N, 1);
    numSets = N;
    rank.assign(N, 0);
    p.assign(N, 0);
    for (int i = 0; i < N; i++) p[i] = i;
  }
  int findSet(int i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }
  bool isSameSet(int i, int j) { return findSet(i) == findSet(j); }
  void unionSet(int i, int j) {
    if (!isSameSet(i, j)) {
      numSets--;
      int x = findSet(i), y = findSet(j);
      if (rank[x] > rank[y]) {
        p[y] = x;
        setSize[x] += setSize[y];
      } else {
        p[x] = y;
        setSize[y] += setSize[x];
        if (rank[x] == rank[y]) rank[y]++;
      }
    }
  }
  int numDisjointSets() { return numSets; }
  int sizeOfSet(int i) { return setSize[findSet(i)]; }
};
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> people;
  for (int i = 0; i < k; ++i) people.push_back(1);
  vector<set<int>> p(m + n + 10);
  for (int i = 1; i <= m + n + 1; ++i) {
    int cur = 0;
    for (int j = 0; j < (int)people.size(); ++j) {
      if (people[j] + n - 1 >= i || people[j] + m + n <= i) {
        cur++;
        p[i].insert(j);
      }
    }
    if (i > 1) {
      bool good = false;
      for (auto it = p[i - 1].begin(); it != p[i - 1].end(); ++it) {
        if (p[i].count(*it)) good = true;
      }
      if (!good) {
        people.push_back(i - 1);
        p[i].insert(people.size() - 1);
        cur++;
      }
    }
    int need = max(k - cur, 0);
    while (need--) {
      people.push_back(i);
      p[i].insert((int)people.size() - 1);
    }
  }
  cout << (int)people.size() << '\n';
  for (int x : people) cout << x << ' ';
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int tc = 1;
  while (tc--) {
    solve();
  }
}
