CF959B Mahmoud and Ehab and the message

Mahmoud wants to send a message to his friend Ehab. Their language consists of $ n $ words numbered from $ 1 $ to $ n $ . Some words have the same meaning so there are $ k $ groups of words such that all the words in some group have the same meaning. Mahmoud knows that the $ i $ -th word can be sent with cost $ a_{i} $ . For each word in his message, Mahmoud can either replace it with another word of the same meaning or leave it as it is. Can you help Mahmoud determine the minimum cost of sending the message? The cost of sending the message is the sum of the costs of sending every word in it.

The first line of input contains integers $ n $ , $ k $ and $ m $ $ (1

The only line should contain the minimum cost to send the message after replacing some words (maybe none) with some words of the same meaning.

In the first sample, Mahmoud should replace the word "second" with the word "loser" because it has less cost so the cost will be 100+1+5+1=107. In the second sample, Mahmoud shouldn't do any replacement so the cost will be 100+1+5+10=116.