#include<cstdio>

 #include<cstdlib>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<map>

 #include<set>

 #include<queue>

 #include<vector>

 #define INF 0x7f7f7f7f

 #define ll long long

 #define pii pair<ll,int>

 #define MOD 10000005

 using namespace std;

 int n;

 ll m;

 pii H[MOD];

 vector<int> vs;

 void insert(ll x){

     int t=x%MOD;

     while(H[t].first&&H[t].first!=x){

         t++;

         if(t>=MOD){

             t=;

         }

     }

     if(!H[t].second) vs.push_back(t);

     H[t]=make_pair(x,H[t].second+);

 }

 int main()

 {

 //    freopen("data.in","r",stdin);

     scanf("%d",&n);

     scanf("%lld",&m);

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

         ll t;scanf("%lld",&t);

         insert(t);

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

             ll q=(t*+)%m;

             insert(q);

             t=q;

         }

     }

     ll ans=;

     for(int i=;i<vs.size();i++){

         ans+=((H[vs[i]].second+H[vs[i]].first)/(H[vs[i]].first+))*(H[vs[i]].first+);

     }

     printf("%lld\n",ans);

     return ;

 }