#include <bits/stdc++.h>
using namespace std;
int n, nn, nnn, a, b, x[1000], ig;
int sumOfThePervious(int limit) {
  int sum = 0;
  for (int i = 0; i < limit; i++) {
    sum += x[i];
  }
  return sum;
}
int main() {
  scanf("%d%d%d", &n, &a, &b);
  int counter = a + b;
  if (counter > n || a == (n - 1) && n != 1) {
    printf("-1");
    return 0;
  }
  nn = n;
  nnn = nn;
  int c = b;
  b == 0 ? b++ : b;
  for (ig = 0; ig <= b; ig++) {
    x[ig] = pow(2, ig);
    if (c == 0) {
      x[ig] = 1;
    }
  }
  int igLimit = ig;
  for (; ig < igLimit + a; ig++) {
    x[ig] = x[ig - 1] + 1;
  }
  int iggLimit = ig;
  for (ig; ig < n; ig++) {
    x[ig] = x[ig - 1];
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", x[i]);
  }
  return 0;
}
