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

#define QwQ3301AwA return 0
#define ll long long

const int N = 2e5 + 5;
int n, m;
vector <int> pos[N];
int w[N];
ll ans = 0;
int val[N];
bool vis[N];
ll f[N][2];

void solve(vector <int> a, vector <int> b) {
	int cn = 0;
	int ia = 0, ib = 0;
	while (ia < (int)a.size() && ib < (int)b.size()) {
		if (a[ia] < b[ib]) cn++, val[cn] = w[a[ia]], vis[cn] = 0, ia++;
		else cn++, val[cn] = w[b[ib]], vis[cn] = 1, ib++;
	}
	while (ia < (int)a.size()) cn++, val[cn] = w[a[ia]], vis[cn] = 0, ia++;
	while (ib < (int)b.size()) cn++, val[cn] = w[b[ib]], vis[cn] = 1, ib++;	
	f[0][0] = f[0][1] = 0;
	for (int i = 1; i <= cn; i++) {
		f[i][0] = f[i - 1][0];
		f[i][1] = f[i - 1][1];
		if (vis[i] == 0) f[i][0] = max(f[i][0], f[i - 1][1] + val[i]);
		else f[i][1] = max(f[i][1], f[i - 1][0] + val[i]);
	}
	ans = max(ans, max(f[cn][0], f[cn][1]));
}

void rsolve(vector <int> a) {
	ll sum = 0;
	for (auto x : a) sum += w[x];
	ans = max(ans, sum);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
		pos[w[i] % m].push_back(i);
	}
	for (int i = 1; i <= m / 2; i++) {
		if (m - i == i) continue;
		solve(pos[i], pos[m - i]);
	}
	rsolve(pos[0]);
	if (m % 2 == 0) rsolve(pos[m / 2]);
	cout << ans;
	QwQ3301AwA;
}