Bohdan against "tails"#18

Bohdan against "tails"

1 second
256 megabytes
Easy

Having seen Sasha's skill in solving "tails", Bohdanchik also decided to settle all his debts in mathematics.

In total, he has tasks, each of which has a specific topic denoted by the number a_i.

Because some topics are repeated, Bohdanchik solves them faster, namely:

Find the total time in minutes that he will spend solving the homework.

In the notation, means rounding down (to the nearest integer), for example, \lfloor 3.14 \rfloor = 3, \lfloor 3.9 \rfloor = 3.

Input

The first line contains two integers and (1\le n\le 10^5, 1\le x\le 10^9) — the number of math tasks and how long Bohdanchik solves the homework of a certain topic for the first time.

The second line contains numbers a_1, a_2, \dots, a_n (1\le a_i\le 10^9) — the topic of the -th task.

Output

Output a single number — the number of minutes needed for Bohdanchik to solve all the tasks.

Examples

Example

Loading
Loading

Example 1

Loading
Loading

Note

In the first test, he will complete the task with topic in minutes, and the task with topic in minutes, spending a total of minutes.

In the second test, when solving the task with topic for the first time, he will spend minutes, when solving it again, he will spend \max(\lfloor \frac{4}{2} \rfloor,1)=2 minutes, and when solving the task with topic for the third time, he will spend \max(\lfloor \frac{2}{2} \rfloor,1)=1 minute, so in total he will spend 4+2+1=7 minutes.

Scoring

In this problem, there are conditional blocks. If your solution works correctly for certain constraints, it will receive a certain number of points. Note that each test is graded individually.

  1. ( points): x=1;

  2. ( points): n\le 1000;

  3. ( points): a_i\le n;

  4. ( points): a_1=a_2=\dots=a_n;

  5. ( points): without additional constraints.