#include <bits/stdc++.h>
#include <vector>
#define int long long
using namespace std;
inline void solve(){
int n,k; cin>>n>>k;
vector<int>v(n);
set<int>s;
map<int,int>m;
for(int i = 0; i<n; i++){cin>>v[i];
}
int ans = 0;
for(int i = 0; i<n; i++){
int to = v[i];
int c = 0;
int ktr = min(to,k);
for(int j = 1; j<=ktr; j++){
if(((to/j)*(to+2))>100000000){c+=(ktr-j+1)*100000000; break;}
else {
int l = (to/j)*(to+2);
if(l==to+2){
c+=(to+2)*(ktr-j+1);
// cout<<'@'<<' ';
break;
}else c+= (to/j)*(to+2);
// cout<<l<<' ';
}
// cout<<(to/j)*(to+2)<<' ';
}
// cout<<endl;
ans+=c;
}
cout<<ans<<endl;
}
signed main(){
solve();
return 0;
}
