#include <bits/stdc++.h>
using namespace std;
int main() {
  long long a1[102] = {0}, b, c, d, i, j, n, m, a, b2, a2;
  bool t;
  cin >> n >> a >> b;
  c = 0;
  b2 = b + 1;
  a2 = a;
  if (n == 2 && a != 0 && b == 0) {
    cout << -1 << endl;
  } else {
    j = 1;
    for (i = 0; i <= b; i++) {
      j = 1;
      while (j <= c && j <= 50000) {
        j++;
      }
      if (j > c && j <= 50000) {
        a1[i] = j;
        c += j;
        b2--;
      }
    }
    j = 1;
    i = b + 1;
    while (a2 != 0 && i < n) {
      j = 1;
      while (j <= a1[i - 1] && c >= j && j <= 50000) {
        j++;
      }
      if (j > a1[i - 1] && c >= j && j <= 50000) {
        a1[i] = j;
        i++;
        c += j;
        a2--;
      } else {
        a1[i] = 1;
        i++;
        c += 1;
      }
    }
    if (a2 + b2 != 0) {
      cout << -1 << endl;
      return 0;
    }
    for (j = i; j < n; j++) {
      a1[j] = 1;
    }
    for (i = 0; i < n; i++) {
      cout << a1[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
