B"One way to create a task is to learn from life. You can choose some experience in real life, formalize it and then you will get a new task. Let's think about a scene in real life: there are lots of people waiting in front of the elevator, each person wants to go to a certain floor. We can formalize it in the following way. We have n people standing on the first floor, the i-th person wants to go to the fi-th floor. Unfortunately, there is only one elevator and its capacity equal to k (that is at most k people can use it simultaneously). Initially the elevator is located on the first floor. The elevator needs |a xe2 x80 x89- xe2 x80 x89b| seconds to move from the a-th floor to the b-th floor (we don't count the time the people need to get on and off the elevator). What is the minimal number of seconds that is needed to transport all the people to the corresponding floors and then return the elevator to the first floor? The first line contains two integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892000) -- the number of people and the maximal capacity of the elevator. The next line contains n integers: f1, xe2 x80 x89f2, xe2 x80 x89..., xe2 x80 x89fn (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89fi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892000), where fi denotes the target floor of the i-th person. Output a single integer -- the minimal time needed to achieve the goal. In first sample, an optimal solution is: "...