100 1
85 75 55 65 39 26 47 16 9 11 3 4 70 23 56 64 36 34 16 13 18 28 32 80 8 79 76 4 21 75 93 51 85 86 100 88 91 71 97 28 66 22 47 87 91 95 3 56 81 53 88 90 21 30 74 45 58 73 36 40 70 51 28 75 20 54 69 52 14 48 52 53 91 81 32 68 16 48 60 66 91 32 55 42 93 51 3 46 23 64 39 1 30 42 20 83 99 29 35 59
 30 2
10 5 46 30 28 18 24 35 73 2 10 24 72 86 97 95 71 12 14 57 27 94 81 59 43 77 22 58 16 96
 30 3
20 37 89 77 74 6 52 87 19 58 3 38 40 38 42 12 1 23 29 38 12 65 15 1 92 45 23 94 61 73
 100 33
84 70 12 53 10 38 4 66 42 1 100 98 42 10 31 26 22 94 19 43 86 5 37 64 77 98 81 40 17 66 52 43 5 7 79 92 44 78 9 95 10 86 42 56 34 91 12 17 26 16 24 99 11 37 89 100 60 74 32 66 13 29 3 24 41 99 93 87 85 74 5 3 70 46 23 12 43 10 24 32 95 2 57 86 29 100 29 62 17 24 4 40 40 73 29 11 69 89 10 31
 8 6
19 15 1 14 7 2 10 14
 10 7
26 11 10 8 5 20 9 27 30 9
 100 3
92 51 91 67 32 97 40 24 78 72 93 90 57 77 66 13 55 24 17 90 65 35 69 97 79 31 85 2 90 80 49 44 73 77 34 45 74 75 35 14 34 56 60 54 36 55 16 49 12 54 92 68 70 71 5 79 67 89 64 80 20 84 4 39 55 84 53 59 68 11 89 89 15 73 67 86 91 78 49 24 58 83 55 34 82 97 27 29 78 15 20 48 9 87 41 34 91 76 82 44
 20 5
33 45 36 13 46 40 15 11 29 44 43 50 14 19 46 46 46 26 42 6
 3 4
3 8 2
 10 10
20 82 19 82 18 96 40 99 87 2
 50 13
53 55 51 81 59 22 11 20 30 80 38 17 8 38 69 52 11 74 16 38 80 97 39 74 78 56 75 28 4 58 80 88 78 89 95 8 13 70 36 29 49 15 74 44 19 52 42 59 92 37
 3 1
8 3 2
 5 1
4 7 9 5 7
 1 3
3
 20 2
4 2 6 9 8 4 4 7 2 3 7 7 10 6 3 5 2 9 8 5
 10 10
75 52 78 83 60 31 46 28 33 17
 8 5
5 2 17 12 16 12 17 3
 3 2
95 25 49
 100 12
90 59 100 12 82 31 66 28 7 13 43 42 48 94 60 32 20 92 37 39 22 55 14 23 77 56 21 55 10 89 93 79 5 80 40 80 6 15 56 82 68 61 32 100 23 7 13 92 32 82 17 85 49 85 13 75 4 7 42 14 84 22 50 12 11 75 4 85 32 96 56 13 34 100 66 37 58 58 24 58 81 63 59 55 89 97 90 69 29 11 71 58 58 43 72 96 81 72 14 64

4801
 1208
 1021
 1467
 16
 43
 4839
 375
 5
 325
 1012
 5
 17
 0
 21
 233
 14
 151
 2377

import java.io.*;
import java.util.*;
import java.text.*;
import java.util.regex.*;
/**
 * Problem-(#) - Main.java
 *
 * @author Isuru Madushanka Weerarathna
 * @team CSECodersV2
 * @written 2011/10/22
 * @competetion IEEEXtreme 5.0
 */


public class Main {

    public static void main(String[] args) {
        try {
            new Main().solve();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public void solve() throws IOException {
        BufferedReader reader = new BufferedReader(new FileReader("input.txt"));
        PrintWriter out = new PrintWriter(new FileWriter("output.txt"));

        int[] sz = getAsInt(reader.readLine().split("[ ]+"));
        int[] jars = getAsInt(reader.readLine().split("[ ]+"));

        PairList plist = new PairList();
        Comparator<Pair> comp = new Comparator<Pair>() {
            public int compare(Pair p1, Pair p2) {
                if (p1 == null) return -1; if (p2 == null) return 1;
                int p = 0;
                if (p1.v1>p2.v1) return -1; if (p1.v1<p2.v1) return 1;
                if (p1.v2>p2.v2) return -1; if (p1.v2<p2.v2) return 1;
                return 0;
            }
        };
        int n=sz[0];
        int k=sz[1];
        for (int i=0;i<n;i++) {
            plist.add(new Pair(jars[i], 0));
        }
        plist.sort(comp);

        int piglet = 0;
        int p = 0;
        Pair pair = plist.pairs.get(p);
        while (pair.v1>0) {

            if (pair.v1<k || pair.v2>=3) {
                piglet += pair.v1;
                pair.v1 = 0;
            } else {
                pair.v1 -= k;
                pair.v2 = pair.v2 + 1;
            }

            plist.sort(comp);
            pair = plist.pairs.get(p);
        }
        out.println(piglet);

        out.flush();
        out.close();
        reader.close();
    }

    private int[] getAsInt(String[] parts) {
        int[] res = new int[parts.length];
        for (int i = 0; i<parts.length; i++) res[i] = Integer.parseInt(parts[i]);
        return res;
    }
    private double[] getAsDouble(String[] parts) {
        double[] res = new double[parts.length];
        for (int i = 0; i<parts.length; i++) res[i] = Double.parseDouble(parts[i]);
        return res;
    }
}

class PairList {

    List<Pair> pairs = new ArrayList<Pair>();

    void add(Pair p) {
        pairs.add(p);
    }
    void add(int value1, int value2) {
        pairs.add(new Pair(value1, value2));
    }

        void sort(Comparator<Pair> comp) {
            Collections.sort(pairs, comp);
        }

}

class Pair {

    int v1 = 0;
    int v2 = 0;

    public Pair(int val1, int val2) {
        v1 = val1;
        v2 = val2;
    }

}
