#include <bits/stdc++.h>
using namespace std;
int n, k, l, a[1000], sum;
int main() {
  scanf("%d%d%d", &n, &k, &l);
  if (l == 0 && k + 1 == n && n > 1) {
    puts("-1");
    return 0;
  }
  if (l > 0) {
    a[1] = 1;
    int sum = 1;
    for (int i = 2; i <= l + 1; ++i) {
      a[i] = sum + 1;
      sum += a[i];
    }
    for (int i = l + 2; i <= l + k + 1; ++i) {
      a[i] = a[i - 1] + 1;
    }
    for (int i = l + k + 2; i <= n; ++i) {
      a[i] = 1;
    }
    for (int i = 1; i <= n; ++i) {
      printf("%d ", a[i]);
    }
  } else {
    a[1] = 1;
    a[2] = 1;
    sum = 2;
    for (int i = 3; i <= k + 2; ++i) {
      a[i] = a[i - 1] + 1;
    }
    for (int i = k + 3; i <= n; ++i) {
      a[i] = 1;
    }
    for (int i = 1; i <= n; ++i) {
      printf("%d ", a[i]);
    }
  }
  return 0;
}
