#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9 + 5;
const long long LINF = (long long)4E18 + 5;
const long double PI = acos(-1.0);
const long double E = 2.718281828459045L;
const double EPS = 1.0e-9;
template <typename T>
T gcd(T a, T b) {
  return (b == 0) ? abs(a) : gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
inline T mod(T a, T b) {
  return (a % b + b) % b;
}
template <typename T>
inline T sqr(T x) {
  return x * x;
}
template <typename T>
inline string toString(const T& x) {
  ostringstream os;
  os << x;
  return os.str();
}
inline long long toint(const string& s) {
  istringstream is(s);
  long long x;
  is >> x;
  return x;
}
inline long double todouble(const string& s) {
  istringstream is(s);
  long double x;
  is >> x;
  return x;
}
inline string tolower(string s) {
  for (typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
    *it = tolower(*it);
  return s;
}
inline string toupper(string s) {
  for (typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
    *it = toupper(*it);
  return s;
}
inline int todecimal(string s) {
  int a = 0;
  for (int i = 0; i < (s.size()); i++) a = 2 * a + (s[i] - '0');
  return a;
}
inline string tobinary(int a) {
  string s;
  while (a != 0) {
    s = (char)(a % 2 + '0') + s;
    a >>= 1;
  }
  return s;
}
inline int isvowel(char c) {
  if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') return 1;
  return 0;
}
inline int isprime(int a) {
  for (int i = 2; i * i <= a; i++)
    if (!(a % i)) return 0;
  return 1;
}
int main() {
  string s;
  int m, n, a, b, d;
  d = 0;
  int e = 0;
  cin >> n >> a >> b;
  if (n == 1) {
    cout << 1;
    return 0;
  }
  if (b == 0 && a == n - 1) {
    cout << -1;
    return 0;
  }
  int g = 0;
  int c[n + 1];
  m = n - (a + b);
  c[0] = 1;
  d = 1;
  g = 1;
  int h = 0;
  m--;
  if (b > 0) {
    for (int i = g; i < g + b; i++) {
      c[i] = d + 1;
      d += c[i];
    }
    g = g + b;
    d = c[g - 1];
  }
  for (int i = g; i < g + m; i++) {
    c[i] = 1;
  }
  g = g + m;
  for (int i = g; i < g + a; i++) {
    c[i] = d + 1;
    d++;
  }
  for (int i = 0; i < n; i++) {
    cout << c[i] << " ";
  }
  return 0;
}
