F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Race

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1    Accepted Submission(s): 1


Problem Description
  Recently, Cdfpysw, the king of alpaca, hold a special go-kart race.
  There are n contestants numbered by 1,2,3……n preparing at the start line, and each go-kart has an accelerated speed vi representing that their speed will increase by vi at each end of the second. They start at the end of time 0, and the initial speed is all 0.
  Cdfpysw is a busy man. Because of that, he won't watch the game all the time. He will watch the game at the end of t second, 2t second, 3t second …… and record the first one now in the game.(If there is a tie, the one with the smallest id is the first one.) And he also don't want the game be boring, so after recording he will use magic to slow down the first one's speed to 0! Now, Cdfpysw want to know the first m times he watch the game, who is the first one.
  Note that changing speed and recording is both at the end of a second and changing speed is before Cdfpysw's recording.
 

Input
  The first line contains three integers n, m and t, descripted above.
(1 <= n <= 100, 1 <= m <= 100, 1 <= t <= 100)
  The second line contains n integers vi, representing the i_th go-kart's accelerated speed. (0 <= vi <= 100)
 

Output
  One line contains m integers seperated by blank, representing the answer.
 

Sample Input
3 2 2 2 3 4
 

Sample Output
3 2
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2025-03-29 17:57:15, Gzip enabled