import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long[string] cache;
long brute(long K, long[] as) {
  as.sort;
  const key = as.to!string;
  auto ptr = key in cache;
  if (ptr) return *ptr;
  long ret;
  
  const asLen = cast(int)(as.length);
  if (asLen) {
    ret = long.min;
    foreach (i; 0 .. asLen) {
      if (as[i] <= K) {
        chmax(ret, as[i] - brute(K, as[0 .. i] ~ as[i + 1 .. $]));
      } else {
        foreach (b; 1 .. as[i]) {
          chmax(ret, 0 - brute(K, as[0 .. i] ~ [b, as[i] - b] ~ as[i + 1 .. $]));
        }
      }
    }
  }
  
  return cache[key] = ret;
}

void main() {
  debug {{
    foreach (K; 1L .. 5L + 1) {
      writeln("K = ", K);
      foreach (a; 1L .. 10L + 1) {
        writeln([a], ": ", brute(K, [a]));
      }
      writeln;
    }
  }}
  
  try {
    for (; ; ) {
      const N = readInt;
      const K = readLong;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      A.sort;
      
      const cut = A.upperBound(K);
      long ans;
      foreach (i; 0 .. cut) {
        ans += (i&1?-1:+1) * A[cut - 1 - i];
      }
      foreach (i; cut .. N) if (A[i] & 1) {
        ans += (cut&1?-1:+1) * (-1);
      }
      debug {
        writeln("ans = ", ans);
      }
      writeln((A.sum + ans) / 2);
    }
  } catch (EOFException e) {
  }
}