Թաքցված խնդիր
|Այս խնդիրը թաքցված է խմբագրական խրհրդի անդամի կողմից քանի որ կամ այն ոչ ճիշտ լեզվով է գրված,|կամ թեստային տվյալներն են սխալ, կամ խնդրի ձևակերպումը պարզ չէ։|

ACM_0190 - FINAL

 

   Formula TheByteis the most famous race competition in ByteLand. The competition is over and each ofndrivers has a number of points. A driver that has more points is placed higher.

   Final standings are not disclosed yet, but we know that the total number of points earned by all the drivers ispand there are onlyddifferent numbers of points among topkdrivers.

   TheByteLand Timesasks you to guess final standings based on the given information.

Input

   The only line of the input file contains four integer numbers:n, p, k and d— the number of drivers, the number of points, the number of top drivers, and the number of different numbers of points among top kdrivers (1≤k≤n≤1000; 0≤p≤1000 000; 1≤d≤k).

Output

   Output the possible standings that match givenn, p, k and d.

   If it is possible to create the correct final standings, you should output final standings. The i-th line of the final standings must contain a number of points earned by i-th driver. Drivers should be ordered by number of points in the descending order.

   If there is no possible final standings satisfying the given data, output the single line “Wrong information”.

Examples

stdin

stdout

1

3 4 2 2

2

1

1

2

3 5 2 2

3

2

0

3

2 5 2 1

Wrong information


Ավելացրեց.Հրանտ Հովհաննիսյան
Ամսաթիվ.2014-04-09
Ժամանակի սահմանափակումը.1s
Ծրագրի տեքստի սահմանափակումը.50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Լեզուներ.Բոլորը բացի ASM32 ASM64 GAWK CLPS CLOJURE D ERL FSHARP FORTRAN GOSU HASK ICON ICK NEM NIM OBJC-CLANG PICO PIKE PYPY PY_NBC RUST SCM guile CHICKEN SED TCL WHITESPACE
Աղբյուրը.Northern QF 2012.F

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.