#include <bits/stdc++.h>
#include <fstream>

using namespace std;
ifstream in ("zebughil.in");
ofstream out ("zebughil.out");
/*
const long long mod = 998244353;

long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
*/
long long dp[131080];
int v[20];
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    long long g,q,n,i,j,t;
    t=3;
    while(t--)
    {
        in>>n>>g;
        for(i=0;i<n;++i)
            in>>v[i];
        for(int mask=1;mask<(1<<n);++mask)
        {
            dp[mask]=g*1LL*n;
            for(int i=0;i<n;++i)
                if(mask&(1<<i))
                {
                    long long cur=dp[mask^(1<<i)];
                    if(g-cur%g>=v[i])
                        dp[mask]=min(dp[mask],cur+v[i]);
                    else
                        dp[mask]=min(dp[mask],cur+(g-cur%g)+v[i]);
                }
        }
        long long ans=dp[(1<<n)-1];
        out<<(ans-1)/g+1<<'\n';
    }
    return 0;
}