# include <bits/stdc++.h>
# define pb push_back
//# define int long long
using namespace std;

mt19937 rnd(time(0));

int RAND(int l, int r){return l + rnd() % (r-l+1);}

const int N = 105;

int n, k, ans = 100000, tot = 0, tmp = 0, arr[N], cnt[15], a[105], b[105];

int calc(){
	int ret = 0, num = 0;
	for (int i = 1;i <= tot;i++){
		num += arr[i];
		if (num > k) ret++;
		num %= k; 
	}
	return ret;
}

void SA(){
	int lst = calc(); ans = min(ans, lst);
	for (double T = tot - 0.1;T > 1e-6;T *= 0.999){
		int ch = (int)T + 1;
		for (int i = 1;i <= ch;i++) a[i] = RAND(1, tot), b[i] = RAND(1, tot), swap(arr[a[i]], arr[b[i]]);
		int nxt = calc(); ans = min(ans, nxt);
		if (nxt < lst || exp((lst-nxt) / T) * UINT_MAX > rnd()) lst = nxt;
		else for (int i = ch;i >= 1;i--) swap(arr[a[i]], arr[b[i]]);
	}
}

int main(){
	scanf("%d%d", &n, &k);
	for (int i = 1;i <= n;i++) scanf("%d", &arr[i]), tmp += (arr[i] / k - (arr[i] % k == 0)), cnt[arr[i] % k]++;
	for (int i = 1;i <= (k-1)/2;i++){
		int num = min(cnt[i], cnt[k-i]);
		cnt[i] -= num; cnt[k-i] -= num;
	}
	if (k % 2 == 0){
		cnt[k/2] &= 1;
	}
//	for (int i = 0;i <= k;i++) printf("%d ", cnt[i]); puts("");
//	puts("**8");
	for (int i = 1;i < k;i++) while (cnt[i]--) arr[++tot] = i;
//	printf("%d\n", tot);
	SA(); SA();
//	printf("%d %d %d\n", tmp, ans, tmp + ans);
	printf("%d\n", tmp+ans);
	return 0;
}