#include <bits/stdc++.h>
using namespace std;
int D[10001], P[10001], r, F[10001];
bool f;
int ok;
int n, m, k;
int main() {
  cin >> n >> m >> k;
  int N, M;
  N = 0, M = 0;
  ok = 0;
  for (int i = 1; i <= 10000; i++) {
    if (!ok) {
      if (N == 0) {
        F[i] = k;
      }
      N++;
      D[i] = k;
      if (N == n) {
        N = 0;
        ok = !ok;
      }
    } else {
      M++;
      if (M == m) {
        M = 0;
        ok = !ok;
      }
    }
  }
  int p = 0;
  for (int i = 2; i <= 10000; i++) {
    if (D[i] < k) {
      int ini = 0;
      if (D[i] == 0) {
        P[p++] = i - 1;
        ini = i - 1;
        i--;
      } else {
        P[p++] = i;
        ini = i;
        i--;
      }
      ok = 0;
      N = 0, M = 0;
      for (int j = ini; j <= 10000; j++)
        if (!ok) {
          if (N == 0) {
            F[j]++;
          }
          N++;
          D[j]++;
          if (N == n) {
            N = 0;
            ok = !ok;
          }
        } else {
          M++;
          if (M == m) {
            M = 0;
            ok = !ok;
          }
        }
    }
  }
  for (int i = 2; i <= 10000; i++)
    if (F[i] == D[i]) {
      P[p++] = i - 1;
      ok = 0;
      N = 0, M = 0;
      for (int j = i - 1; j <= 10000; j++)
        if (!ok) {
          if (N == 0) {
            F[j]++;
          }
          N++;
          D[j]++;
          if (N == n) {
            N = 0;
            ok = !ok;
          }
        } else {
          M++;
          if (M == m) {
            M = 0;
            ok = !ok;
          }
        }
    }
  int r = k + p;
  cout << r << endl;
  for (int i = 0; i < k; i++) cout << 1 << " ";
  for (int i = 0; i < p; i++) cout << P[i] << " ";
  return 0;
}
