Problem: «Next please», — the princess called and cast an estimating glance at the next groom.

The princess intends to choose the most worthy groom, this is, the richest one. Whenever she sees a groom who is more rich than each of the previous ones, she says a measured «Oh...». Whenever the groom is richer than all previous ones added together, she exclaims «Wow!» (no «Oh...» in this case). At the sight of the first groom the princess stays calm and says nothing.

The fortune of each groom is described with an integer between 1 and 50000. You know that during the day the princess saw n grooms, said «Oh...» exactly a times and exclaimed «Wow!» exactly b times. Your task is to output a sequence of n integers t1, t2, ..., tn, where ti describes the fortune of i-th groom. If several sequences are possible, output any of them. If no sequence exists that would satisfy all the requirements, output a single number -1.

Input

The only line of input data contains three integer numbers n, a and b (1 ≤ n ≤ 100, 0 ≤ a, b ≤ 15, n > a + b), separated with single spaces.

Output

Output any sequence of integers t1, t2, ..., tn, where ti (1 ≤ ti ≤ 50000) is the fortune of i-th groom, that satisfies the given constraints. If no sequence exists that would satisfy all the requirements, output a single number -1.

Examples

Input

10 2 3


Output

5 1 3 6 16 35 46 4 200 99

Input

5 0 0


Output

10 10 6 6 5

Note

Let's have a closer look at the answer for the first sample test. 

  * The princess said «Oh...» (highlighted in bold): 5 1 3 6 16 35 46 4 200 99. 
  * The princess exclaimed «Wow!» (highlighted in bold): 5 1 3 6 16 35 46 4 200 99. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      result *= a;
    }
    a *= a;
    b /= 2;
  }
  return result;
}
long long gcd(long long x, long long y) {
  long long r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
long long countSetBits(long long x) {
  long long Count = 0;
  while (x > 0) {
    if (x & 1) Count++;
    x = x >> 1;
  }
  return Count;
}
bool isPerfectSquare(long long n) {
  long long sr = sqrt(n);
  if (sr * sr == n)
    return true;
  else
    return false;
}
long long mod(long long x, long long M) { return ((x % M + M) % M); }
long long add(long long a, long long b, long long M) {
  return mod(mod(a, M) + mod(b, M), M);
}
long long mul(long long a, long long b, long long M) {
  return mod(mod(a, M) * mod(b, M), M);
}
long long powerM(long long a, long long b, long long M) {
  long long res = 1ll;
  while (b) {
    if (b % 2ll == 1ll) {
      res = mul(a, res, M);
    }
    a = mul(a, a, M);
    b /= 2ll;
  }
  return res;
}
long long MAXN = 100050;
vector<long long> fact(MAXN + 1);
void sieve_of_erantothenes() {
  fact[1] = 1;
  for (long long i = 2; i <= MAXN; i++) fact[i] = i;
  for (long long i = 4; i <= MAXN; i += 2) fact[i] = 2;
  for (long long i = 3; i * i <= MAXN; i++) {
    if (fact[i] == i) {
      for (long long j = i * i; j <= MAXN; j += i)
        if (fact[j] == j) fact[j] = i;
    }
  }
}
long long nCr(long long n, long long k) {
  if (n < k) return 0;
  if (k == 0) return 1;
  long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long modInverse(long long n, long long M) { return powerM(n, M - 2, M); }
long long nCrM(long long n, long long r, long long M) {
  if (n < r) return 0;
  if (r == 0) return 1;
  vector<long long> fact(n + 1);
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) {
    fact[i] = mul(fact[i - 1], i, M);
  }
  return mul(mul(fact[n], modInverse(fact[r], M), M),
             modInverse(fact[n - r], M), M);
}
void solve() {
  long long n, a, b;
  cin >> n >> a >> b;
  vector<long long> ans(n);
  ans[0] = 1;
  long long sum = 1;
  for (long long i = 1; i <= b; i++) {
    ans[i] = 1 + sum;
    sum += ans[i];
  }
  for (long long i = b + 1; i < b + 1 + a; i++) {
    ans[i] = ans[i - 1] + 1;
  }
  for (long long i = b + 1 + a; i < n; i++) {
    ans[i] = ans[i - 1];
  }
  if (a == n - 1 && b == 0 && a != 0) {
    cout << -1 << '\n';
    return;
  } else if (b == 0 && a != 0) {
    ans[1] = 1;
    for (long long i = b + 2; i < b + 2 + a; i++) {
      ans[i] = ans[i - 1] + 1;
    }
    for (long long i = b + 2 + a; i < n; i++) {
      ans[i] = ans[i - 1];
    }
  }
  for (auto& w : ans) cout << w << " ";
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  solve();
  return 0;
}