#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int main(void)
{
	int n,d;
	scanf("%d%d",&n,&d);
	int tot = 0;
	vector<int> a(d);
	for(int i=1; i<=n; ++i)
	{
		int x;
		scanf("%d",&x);
		tot += x; ++a[x % d];
	}
	
	int has = a[0]; a[0] = 0;
	for(int i=1,j=d-1; i<j; ++i, --j)
	{
		int t = min(a[i], a[j]);
		has += t; a[i] -= t; a[j] -= t;
	}
	if(d % 2 == 0)
	{
		has += a[d/2] / 2; a[d/2] %= 2;
	}
	
	int all = 1;
	vector<int> coef(d);
	for(int i=1; i<d; ++i)
		coef[i] = all, all *= a[i] + 1;
	
	vector< vector<int> > dp(all, vector<int>(d, 0));
	for(int mask=1; mask<all; ++mask)
	{
		for(int i=1; i<d; ++i)
			if(a[i] && mask / coef[i] % (a[i] + 1))
			{
				for(int j=0; j<d; ++j)
					dp[mask][j] = max(dp[mask][j], dp[mask - coef[i]][(j + i) % d] + (j == 0));
			}
	}
	
	int ans = (tot / d) - (has + dp[all-1][0]);
	printf("%d\n",ans);
	return 0;
}