C. Terse princess
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
«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.

构造一个序列，使得a的个数和b的个数符合要求
其中a的个数代表 后一个数比前一个数大但是小于前面所有的数
b的个数代表 后一个数比前面所有的数都大
其他情况既不符合a也不符合b
注意一种特殊情况当要求所有a的个数为全部（最大n-1)时，这种情况不符合情况，因为必定会出现b（但 1 0 0时成立）
这时候利用等比数列先填b再用递增数列填a即可满足题意