ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules

USU Junior Contest October'2003

About     Problems     Submit solution     Judge status     Standings
Contest is over

G. Elections

Time limit: 1.0 second
Memory limit: 64 MB
The next in turn elections are to come soon. All the fences are postered with leaflets and the mail boxes are full of throwaways. Cheeky guys are looking at us from TV’s and promise to make our life better… And programmer Vasechkin is knee-deep in work. He is to write a program that would calculate the results of voting.

Input

The first line contains a number of candidates N (1 ≤ N ≤ 10000) and a number of electors M (1 ≤ M ≤ 10000). Then M lines follow, each one contains a number of candidate that the elector voted for. The candidates are numbered with integers from 1 to N.

Output

Output N lines. The i-th line should contain the percent of electors that voted for the i-th candidate (to within 2 decimals).

Sample

inputoutput
3 6
1
2
3
2
1
1
50.00%
33.33%
16.67%
Problem Author: Den Raskovalov
Problem Source: Open collegiate programming contest for high school children of the Sverdlovsk region, October 11, 2003
To submit the solution for this problem go to the Problem set: 1263. Elections