ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

Contest is over

## D. One and a Half Diggers

Time limit: 0.5 second
Memory limit: 64 MB
Vitya Perestukin is solving the following problem: Three diggers can dig a trench in exactly one day. How many diggers are needed to dig the same trench in exactly two days? Vitya has concluded that one and a half diggers are needed. But there can't be such an answer. Actually, two diggers are needed: on the first day only one digger will work, and on the second day they both will work.
It is known that m diggers can dig a trench in exactly d1 days if they all work every day. Help Vitya compile a work schedule according to which a minimal number of diggers can dig a trench in exactly d2 days.

### Input

The only input line contains the integers m, d1, and d2 (1 ≤ m, d1, d2 ≤ 10 000).

### Output

In the only line output d2 integers, which are the numbers of diggers that should work on each of the days so that the trench will be dug in time. It is possible that on some days (including the last day) nobody will work. If there are several solutions, output any of them.

### Sample

inputoutput
`3 1 2`
`1 2`
Problem Author: Magaz Asanov
Problem Source: XI USU Open Personal Contest (March 13, 2010)
To submit the solution for this problem go to the Problem set: 1756. One and a Half Diggers