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;
int on_bit(int x, int pos) {
  x |= (1 << pos);
  return x;
}
int off_bit(int x, int pos) {
  x &= ~(1 << pos);
  return x;
}
bool is_on_bit(int x, int pos) { return ((x & (1 << pos)) != 0); }
int flip_bit(int x, int pos) {
  x ^= (1 << pos);
  return x;
}
int lsb(int x) { return x & (-x); }
int on_bit_all(int x, int pos) {
  x = (1 << pos) - 1;
  return x;
}
const double EPS = 1e-9;
const double PI = 2 * acos(0.0);
const int INF = 0x3f3f3f3f;
const long long LLINF = 1e18;
const int MOD = 1e9 + 7;
int add(long long a, long long b) { return ((a % MOD) + (b % MOD)) % MOD; }
int sub(long long a, long long b) { return ((a % MOD) - (b % MOD)) % MOD; }
int mult(long long a, long long b) { return ((a % MOD) * (b % MOD)) % MOD; }
long long powmod(long long a, long long b) {
  long long res = 1;
  assert(b >= 0);
  a %= MOD;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  int n, oh, wow;
  scanf("%d%d%d", &n, &oh, &wow);
  if (n == 1) {
    puts("322");
    return 0;
  }
  int exp_a = oh, exp_b = wow;
  vector<int> v;
  v.push_back(1);
  if (!wow) v.push_back(1);
  while (wow--) {
    v.push_back(v[((int)(v).size()) - 1] << 1);
  }
  while (oh--) {
    v.push_back(v[((int)(v).size()) - 1] + 1);
  }
  if (((int)(v).size()) > n) {
    puts("-1");
    return 0;
  }
  while (((int)(v).size()) != n) {
    v.push_back(v[((int)(v).size()) - 1]);
  }
  int a = 0, b = 0;
  for (int i = 1; i < (int)n; i++) {
    int _sum = 0;
    for (int j = 0; j < (int)i; j++) _sum += v[j];
    if (_sum < v[i])
      b++;
    else if (v[i] > v[i - 1])
      a++;
  }
  if (a != exp_a || b != exp_b)
    puts("-1");
  else {
    for (int i = 0; i < (int)((int)(v).size()); i++) {
      if (i) printf(" ");
      printf("%d", v[i]);
    }
    puts("");
  }
  return 0;
}