#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

#include<atcoder/all>

void solve() {
  int n,k;
  cin>>n>>k;
  vector<int> a(n);
  rep(i,0,n) cin>>a[i];
  priority_queue<ll> pq;
  vector<ll> tmp;
  rep(i,0,n){
    if(a[i]>k) tmp.push_back(a[i]);
    else pq.push(a[i]);
  }
  vector<ll> ans(2,0);
  int cnt=0;
  while(!pq.empty()||!tmp.empty()){
    if(!pq.empty()){
      ll t=pq.top();
      pq.pop();
      ans[cnt]+=t;
    }else{
      ll t=tmp.back();
      tmp.pop_back();
      ll a=t/2;
      ll b=t-a;
      if(a>k) tmp.push_back(a);
      else pq.push(a);
      if(b>k) tmp.push_back(b);
      else pq.push(b);
    }
    cnt^=1;
  }
  cout<<ans[0]<<"\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}