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
Pawankumar P:
20141202 16:06:50
Half century on spoj. 

Manraj Singh:
20141022 21:52:44
Taught me many features of STL. Great problem. :D 

pandu ranga rao:
20140712 10:48:33
Really STL rocks...... :) 

krishna kumar:
20140623 15:56:46
wrong ans at 8th case .... any cornor case ??


SAGAR JAIN:
20140526 19:53:19
What is the use of C?


P_Quantum:
20140514 20:26:30
nice prblm..!! 

AlcatraZ:
20140411 22:56:44
Nice problem.. STL is awesome !! 

RAMSDEN:
20140320 18:05:41
easy but nice prob.


Avinash:
20140313 18:35:33
Cleverly crafted problem ! thanks ! Last edit: 20140313 18:47:07 

Aravindan Chandrasekaran:
20140313 17:02:16
Nice problem , learnt a lot (Y) 
Added by:  BLANKRK 
Date:  20140128 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 