#include <bits/stdc++.h>
using namespace std;
int n, a, b, SOL[110], i;
int main() {
  cin >> n >> a >> b;
  if ((1 << b) > 50000) {
    cout << -1;
    return 0;
  }
  if (((1 << b) + a) > 50000) {
    cout << -1;
    return 0;
  }
  SOL[1] = 1;
  i = 2;
  if (!b) {
    SOL[2] = 1;
    i = 3;
  }
  while (b) {
    SOL[i] = SOL[i - 1] + SOL[i - 1];
    b--;
    i++;
  }
  while (a && i <= n) {
    SOL[i] = SOL[i - 1] + 1;
    i++;
    a--;
  }
  while (i <= n) {
    SOL[i] = 1;
    i++;
  }
  if (a) {
    cout << -1;
    return 0;
  }
  for (i = 1; i <= n; i++) cout << SOL[i] << " ";
  return 0;
}
