#include <iostream>
#include <algorithm>

int main() {
    int N, x;
    std::cin >> N >> x;
    int A[N];
    for (int i = 0; i < N; ++i) {
        std::cin >> A[i];
    }
    std::sort(A, A + N);

    int maxAdag = 0;
    for (int i = 0; i < N; ++i) {
        int liternyi = A[i];
        if (x <= liternyi) {
            ++maxAdag;
            --liternyi;
        }
        int hozzaontott = liternyi / x;
        maxAdag += hozzaontott;
    }
    std::cout << maxAdag << std::endl;
    return 0;
}