RKS  RK Sorting
RK is a great code breaker. He knows any cipher in the world can be broken by frequency analysis. He intercepted an enemy message. The message consists of N numbers, smaller than or equal to C. RK belives freqency analysis consists of sorting this sequence so that more frequent numbers appear before less frequent ones.
Formally, the sequence must be sorted so that given any two numbers X and Y , X appears before Y if the number of times X appears in the original sequence is larger than the number of time Y does. If the number of appearances is equal, the number whoes value appears sooner in the input should appear sooner in the sorted sequence.
Help RK by creating a "frequency sorter".
Input
First line of input contains two integers, N (1 <= N <= 1000), length of message, and C (1 <= C <= 10^9), the number from task description. Next line contains N integers smaller than or equal to C, message itself.
Output
First and only line of output should contain N numbers, the sorted sequence.
Sample
Input 9 3 1 3 3 3 2 2 2 1 1 Output 1 1 1 3 3 3 2 2 2
Input 5 2 2 1 2 1 2 Output 2 2 2 1 1
hide comments
Atul Aditya:
20140306 14:51:34
@[blank]...my submission id is 11196002..


785227:
20140303 02:53:03
STL rocksssssss ... AC at first attempt... Great problem 

apg7:
20140218 22:01:58
My 100th..:) 

Ouditchya Sinha:
20140216 21:51:21
Nice Problem! Enjoyed solving it. :) 

yaswanth:
20140214 11:30:33
piece of cake using STL :) 

bale:
20140212 18:14:29
ac in one go....still a nice prbl.... Last edit: 20140227 18:09:05 

Jumpy:
20140211 17:29:12
thought would be difficult.. 

JordanBelfort:
20140204 23:36:39
easy :)


anurag garg:
20140204 15:42:32
difficult for me....finally AC 

shannider:
20140202 12:13:51
Last edit: 20140202 12:14:05 
Added by:  BLANKRK 
Date:  20140128 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 