#include <iostream>

#include <string>

#include <string.h>

using namespace std;

long MAX=;

int main(){

    long m[+];

    int n,K;

    cin>>n>>K;

    for (int i = ; i < n; ++i) {

        cin>>m[i];

    }

    for (int j = ; j < n; ++j) {

        for (int i = j + ; i < n; ++i) {

            for (int k = i + ; k < n; ++k) {

                if ((m[j]+m[k]+m[i])%K== && (MAX<m[j]+m[i]+m[k]) ){

                    MAX=m[j]+m[i]+m[k];

                }

            }

        }

    }

    cout<<MAX;

}

/*
*这是官方题解，但是我觉得有点问题，我会再改一下的
*/

#include <iostream>

#include <string>

#include <string.h>

#include <vector>

using namespace std;

int n,K;

long MAX=;

int x;

void work(){

    cin>>n>>K;

    vector<vector<int>> group(K,vector<int>());

    int re;

    for (int i = ; i < n; ++i) {

        cin>>x;

        re=x%K;

        //cout<<re<<endl;

        if(x>group[re][]){//初始值均为０，所以没有问题

            group[re][]=group[re][];

            group[re][]=group[re][];

            group[re][]=x;

        }

        else if(x>group[re][]){

            group[re][]=group[re][];

            group[re][]=x;

        } else

            group[re][]=x;

        //cout<<re<<":"<<group[re][0]<<" "<<group[re][1]<<" "<<group[re][2]<<endl;

    }

    long v1,v2,v3;

    for (int j = ; j < K; ++j) {

        for (int i = j; i < K; ++i) {

            if(group[j][]==)

                continue;

            int kk=(K-i+K-j)%K;

            v1=group[j][];

            //cout<<"v1分别是"<<v1<<endl;

            if(i==j) {

//                if(!group[i][1])

//                    continue;

                v2 = group[i][];

                if(j==kk) {

//                    if(!group[j][2])

//                        continue;

                    v3 = group[j][];

                }

                else {

//                    if(!group[kk][0])

//                        continue;

                    v3 = group[kk][];

                }

            }

            else{

//                if(!group[i][0])

//                    continue;

                v2=group[i][];

                if(j==kk){

//                    if(!group[j][1])

//                        continue;

                    v3=group[j][];

                } else if(i==kk) {

                    v3 = group[kk][];

                } else {

                    v3 = group[kk][];

                }

            }

            if(v1+v2+v3>MAX)

                //cout<<v1<<" "<<v2<<" "<<v3<<endl;

                MAX=v1+v2+v3;

            //cout<<MAX;

        }

    }

    cout<<MAX;

}

int main(){

    work();

    return ;

}