#include <bits/stdc++.h>
using namespace std;
int sol[50002], n, a, b;
void init() {
  cin >> n >> a >> b;
  if (a + b + 1 > n) {
    cout << -1 << endl;
    return;
  }
  sol[1] = 2;
  int s = sol[1];
  for (int i = 2; i <= b + 1; i++) {
    sol[i] = s + 1;
    s += sol[i];
  }
  int i, j;
  for (i = b + 2, j = 1; j <= a; j++, i++) sol[i] = 1 + sol[i - 1];
  for (int i = a + b + 2; i <= n; i++) sol[i] = 1;
  int tmp = sol[1];
  for (int i = 1; i <= n; i++) tmp = ((tmp > sol[i]) ? tmp : sol[i]);
  if (tmp > 50000) {
    cout << -1 << endl;
    return;
  }
  if (b == 0 && a > 0) {
    if (n == a + 1) {
      cout << -1 << endl;
      return;
    }
    sol[2] = 2;
    for (int i = 3; i <= a + 2; i++) {
      sol[i] = i;
    }
  }
  for (int i = 1; i <= n - 1; i++) cout << sol[i] << " ";
  cout << sol[n] << endl;
}
int main() {
  init();
  return 0;
}
