#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int c[N];
int n, a, b;
int s, t, ss, tt;
int main() {
  scanf("%d%d%d", &n, &a, &b);
  c[1] = 1;
  if (b == 0) {
    if (a > n - 2 && a) return 0 * puts("-1");
    c[2] = 1;
    for (int i(3); i <= (a + 2); ++i) c[i] = c[i - 1] + 1;
    for (int i(a + 3); i <= (n); ++i) c[i] = c[i - 1];
    for (int i(1); i <= (n); ++i) printf("%d ", c[i]);
    return 0;
  }
  s = 1;
  for (int i(2); i <= (b + 1); ++i) {
    c[i] = s + 1;
    s += c[i];
  }
  for (int i(b + 2); i <= (a + b + 1); ++i) c[i] = c[i - 1] + 1;
  for (int i(a + b + 2); i <= (n); ++i) c[i] = c[i - 1];
  s = c[1], t = c[1];
  for (int i(2); i <= (n); ++i) {
    if (s < c[i])
      ++ss;
    else if (t < c[i])
      ++tt;
    t = max(t, c[i]);
    s += c[i];
  }
  if (tt != a || ss != b) return 0 * puts("-1");
  if (c[n] <= 5e4)
    for (int i(1); i <= (n); ++i) printf("%d ", c[i]);
  else
    puts("-1");
  return 0;
}
