#include <bits/stdc++.h>
using namespace std;

int n, k, al = 1, cnt[15], ans, a[105], sm, cf[15], dp[100005][10];

int main() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		sm += a[i], cnt[a[i] % k]++;
	}
	for (int i = 1, j = k - 1; i < j; i++, j--) {
		int tmp = min(cnt[i], cnt[j]);
		ans += tmp, cnt[i] -= tmp, cnt[j] -= tmp;
	}
	if (k % 2 == 0) ans += cnt[k / 2] / 2, cnt[k / 2] &= 1;
	for (int i = 1; i < k; i++) cf[i] = al, al *= cnt[i] + 1;
	for (int i = 1; i < al; i++) {
		for (int j = 1; j < k; j++) {
			if (cnt[j] && i / cf[j] % (cnt[j] + 1)) {
				for (int o = 0; o < k; o++) {
					dp[i][o] = max(dp[i][o], dp[i - cf[j]][(j + o) % k] + (!o));
				}
			}
		}
	}
	printf("%d\n", sm / k - (ans + dp[al - 1][0]));
	return 0;
}