Polycarp has n wheels and a car with m slots for wheels. The initial pressure in the i-th wheel is a_i.

Polycarp's goal is to take exactly m wheels among the given n wheels and equalize the pressure in them (then he can put these wheels in a car and use it for driving). In one minute he can decrease or increase the pressure in any (single) wheel by 1. He can increase the pressure no more than k times in total because it is hard to pump up wheels.

Help Polycarp and say what is the minimum number of minutes he needs to spend to equalize the pressure of at least m wheels among the given n wheels.

Input

The first line of the input contains three integers n, m and k (1 ≤ m ≤ n ≤ 2 ⋅ 10^5, 0 ≤ k ≤ 10^9) — the number of wheels, the number of slots for wheels in a car and the number of times Polycarp can increase by 1 the pressure in a wheel.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the pressure in the i-th wheel.

Output

Print one integer — the minimum number of minutes Polycarp needs to spend to equalize the pressure in at least m wheels among the given n wheels.

Examples

Input


6 6 7
6 15 16 20 1 5


Output


39


Input


6 3 1
4 8 15 16 23 42


Output


8


Input


5 4 0
5 5 5 4 5


Output


0

Source: codeforces | Difficulty: UNKNOWN_DIFFICULTY
Tags: Sorting

Greedy algorithms


Solutions: