## Algorithm

C. Winnie-the-Pooh and honey
time limit per test
1 second
memory limit per test
256 megabytes
input
input.txt
output
output.txt

As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may guess, Winnie and the Piglet asked to come at the Rabbit's place. Thus, there are n jars of honey lined up in front of Winnie-the-Pooh, jar number i contains ai kilos of honey. Winnie-the-Pooh eats the honey like that: each time he chooses a jar containing most honey. If the jar has less that k kilos of honey or if Winnie-the-Pooh has already eaten from it three times, he gives the jar to Piglet. Otherwise he eats exactly k kilos of honey from the jar and puts it back. Winnie does so until he gives all jars to the Piglet. Count how much honey Piglet will overall get after Winnie satisfies his hunger.

Input

The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 100). The second line contains n integers a1a2, ..., an, separated by spaces (1 ≤ ai ≤ 100).

Output

Print a single number — how many kilos of honey gets Piglet.

Examples
input
Copy
`3 315 8 10`
output
Copy
`9`

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <cstdio>

int main(){

FILE * inputFile = fopen("input.txt","r");
int n(0), k(0); fscanf(inputFile, "%d %d", &n, &k);

int total(0);
while(n--){
int quantity(0); fscanf(inputFile, "%d", &quantity);
if(quantity < k){total += quantity;}
else if(quantity <= 3 * k){total += quantity % k;}
else{total += quantity - 3 * k;}
printf("%d\n", total);
}
fclose(inputFile);

FILE * outputFile = fopen("output.txt","w");
fprintf(outputFile, "%d\n", total);
fclose(outputFile);

return 0;
}``````
Copy The Code &

Input

cmd
3 3
15 8 10

Output

cmd
9