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 a1, a2, ..., an, separated by spaces (1 ≤ ai ≤ 100).

Output

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

Examples

Input

3 3
15 8 10


Output

9
//package Contest_20;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;


public class f {
    
    void solve() throws  Exception{
        int n = in.nextInt();
        int k = in.nextInt();
        int []a = new int[n];
        for (int i = 0; i<n; i++)
            a[i] = in.nextInt();
        int ans = 0;
        for (int i = n - 1; i >= 0; i--){
            if (a[i] >= 3 * k)
                ans += a[i] - 3 * k;
            else 
                ans += a[i] % k;
        }
        out.println(ans);
    }
    
    FastScanner in;
    PrintWriter out;
    
    String input = "input.txt";
    String output = "output.txt";
    void run(){
        try{
            BufferedReader bf;
            if (input.length() == 0)
                bf = new BufferedReader(new InputStreamReader(System.in));
            else 
                bf = new BufferedReader(new FileReader(input));
            in = new FastScanner(bf);
            if (output.length() == 0)
                out = new PrintWriter(System.out);
            else 
                out = new PrintWriter(new File(output));
            
            solve();
            
            out.flush();
            out.close();
        }catch (Exception ex){
            ex.printStackTrace();
            out.flush();
            out.close();
        }finally{
            out.close();
        }
    }
    
    public static void main(String[] args) {
        new f().run();
    }
    
    
    class FastScanner{
        BufferedReader bf;
        StringTokenizer st;

        public FastScanner(BufferedReader bf) {
            this.bf = bf;
        }
        
        public String next() throws IOException{
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(bf.readLine());
            return st.nextToken();
        }
        
        public int nextInt() throws IOException{
            return Integer.parseInt(next());
        }
        
        public long nextLong() throws IOException{
            return Long.parseLong(next());
        }

        private int[] readIntArray(int n) throws IOException {
            int []t = new int[n];
            for (int i = 0; i<n; i++)
                t[i] = nextInt();
            return t;
        }
    }
    
}

      	 		     					 	