#include <bits/stdc++.h>
#define rep(i, f, t) for(int i(f); i <= t; ++i)
#define re(i, t) for(int i(1); i <= t; ++i)
#define per(i, t, f) for(int i(t); i >= f; --i)
#define pe(i, t) for(int i(t); i >= 1; --i)
#define nx(i, u) for(int i(head[u]); i; i = e[i].nxt)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
// #define int long long
using namespace std;
typedef pair <int, int> pii;
#define pb push_back
#define fi first
#define se second
#define ix(l, r) ((l + r) | (l != r))
#define ls (ix(l, mid))
#define rs (ix(mid + 1, r))
#define mp(i, j) (make_pair(i, j))
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define eps 1e-10
#define look_memory cerr<<abs(&sT-&eD)/1024.0/1024<<'\n'
bool sT;


namespace IO {
char buf[1 << 21], *p1 = buf, *p2 = buf, buf1[1 << 21];
inline char gc() {
    return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++;
}

#ifndef ONLINE_JUDGE
#endif

// #define gc getchar

template<class I>
inline void read(I &x) {
    x = 0;
    I f = 1;
    char c = gc();
    while (c < '0' || c > '9') {
        if (c == '-')
            f = -1;
        c = gc();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = gc();
    }
    x *= f;
}

template<class I>
inline void write(I x) {
    if (x == 0) {
        putchar('0');
        return;
    }
    I tmp = x > 0 ? x : -x;
    if (x < 0)
        putchar('-');
    int cnt = 0;
    while (tmp > 0) {
        buf1[cnt++] = tmp % 10 + '0';
        tmp /= 10;
    }
    while (cnt > 0)
        putchar(buf1[--cnt]);
}

#define in(x) read(x)
#define outn(x) write(x), putchar('\n')
#define out(x) write(x), putchar(' ')

} using namespace IO;

const int N = 105;
int n, k, m;
int a[N], b[10], lst[10];
int ans;
int f[105000005];

int solve () {
    int res = 0;
    re(i, n) {
        res = res * (m+1) + b[i] + 1;
    }
    if(f[res] != inf) return f[res];
    int sum = 0;
    re(i, n) {
        sum += (lst[i] - b[i]) * a[i];
    }
    sum %= k;
    re(i, n) {
        if(b[i]) {
            --b[i];
            f[res] = min(f[res], solve() + ((sum + a[i]) > k));
            ++b[i];
        }
    }
    return f[res];
}

int main () {  
    memset(f, 0x3f, sizeof(f)); 
    read(n), read(k);
    re(i, n) {
        read(a[0]);
        ans += a[0] / k;
        a[0] %= k;
        if(a[0]) {
            ++b[a[0]];
        }
        else --ans;

    } 
    re(i, k-1) {
        if(k - i > i) {
            int w = min(b[i], b[k-i]);
            b[i] -= w, b[k-i] -= w;
        }
        else if(k - i == i) {
            b[i] = b[i] & 1;
        }
    }
    n = 0; 
    re(i, k-1) {
        if(b[i]) {
            a[++n] = i;
            b[n] = b[i]; 
            m += b[n];
        }
    } 
    int res = 0;
    re(i, n) res = res * (m+1) + 1;
    f[res] = 0;
    re(i, n) lst[i] = b[i];  
    int w = solve(); 
    ans += w;
    outn(ans);
    return 0;
}