#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
  fast_ios() {
    cin.tie(nullptr), ios::sync_with_stdio(false),
        cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T, typename V>
void ndarray(vector<T> &vec, const V &val, int len) {
  vec.assign(len, val);
}
template <typename T, typename V, typename... Args>
void ndarray(vector<T> &vec, const V &val, int len, Args... args) {
  vec.resize(len),
      for_each(begin(vec), end(vec), [&](T &v) { ndarray(v, val, args...); });
}
template <typename T>
bool chmax(T &m, const T q) {
  return m < q ? (m = q, true) : false;
}
template <typename T>
bool chmin(T &m, const T q) {
  return m > q ? (m = q, true) : false;
}
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
  return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
  return make_pair(l.first - r.first, l.second - r.second);
}
template <typename T>
vector<T> sort_unique(vector<T> vec) {
  sort(vec.begin(), vec.end()),
      vec.erase(unique(vec.begin(), vec.end()), vec.end());
  return vec;
}
template <typename T>
int arglb(const std::vector<T> &v, const T &x) {
  return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x));
}
template <typename T>
int argub(const std::vector<T> &v, const T &x) {
  return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x));
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << '[';
  for (auto v : vec) os << v << ',';
  os << ']';
  return os;
}
template <typename T, size_t sz>
ostream &operator<<(ostream &os, const array<T, sz> &arr) {
  os << '[';
  for (auto v : arr) os << v << ',';
  os << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec) {
  os << "deq[";
  for (auto v : vec) os << v << ',';
  os << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T, typename TH>
ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
  os << '(' << pa.first << ',' << pa.second << ')';
  return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
  os << '{';
  for (auto v : mp) os << v.first << "=>" << v.second << ',';
  os << '}';
  return os;
}
template <typename TK, typename TV, typename TH>
ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) {
  os << '{';
  for (auto v : mp) os << v.first << "=>" << v.second << ',';
  os << '}';
  return os;
}
template <class Cap = long long, class Cost = long long,
          Cost INF_COST = std::numeric_limits<Cost>::max() / 2>
struct MinCostFlow {
  struct _edge {
    int to, rev;
    Cap cap;
    Cost cost;
    template <class Ostream>
    friend Ostream &operator<<(Ostream &os, const _edge &e) {
      return os << '(' << e.to << ',' << e.rev << ',' << e.cap << ',' << e.cost
                << ')';
    }
  };
  bool _is_dual_infeasible;
  int V;
  std::vector<std::vector<_edge>> g;
  std::vector<Cost> dist;
  std::vector<int> prevv, preve;
  std::vector<Cost> dual;
  std::vector<std::pair<int, int>> pos;
  bool _initialize_dual_dag() {
    std::vector<int> deg_in(V);
    for (int i = 0; i < V; i++) {
      for (const auto &e : g[i]) deg_in[e.to] += (e.cap > 0);
    }
    std::vector<int> st;
    st.reserve(V);
    for (int i = 0; i < V; i++) {
      if (!deg_in[i]) st.push_back(i);
    }
    for (int n = 0; n < V; n++) {
      if (int(st.size()) == n) return false;
      int now = st[n];
      for (const auto &e : g[now]) {
        if (!e.cap) continue;
        deg_in[e.to]--;
        if (deg_in[e.to] == 0) st.push_back(e.to);
        if (dual[e.to] >= dual[now] + e.cost) dual[e.to] = dual[now] + e.cost;
      }
    }
    return true;
  }
  bool _initialize_dual_spfa() {
    dual.assign(V, 0);
    std::queue<int> q;
    std::vector<int> in_queue(V);
    std::vector<int> nvis(V);
    for (int i = 0; i < V; i++) q.push(i), in_queue[i] = true;
    while (q.size()) {
      int now = q.front();
      q.pop(), in_queue[now] = false;
      if (nvis[now] > V) return false;
      nvis[now]++;
      for (const auto &e : g[now]) {
        if (!e.cap) continue;
        if (dual[e.to] > dual[now] + e.cost) {
          dual[e.to] = dual[now] + e.cost;
          if (!in_queue[e.to]) in_queue[e.to] = true, q.push(e.to);
        }
      }
    }
    return true;
  }
  bool initialize_dual() {
    return !_is_dual_infeasible or _initialize_dual_dag() or
           _initialize_dual_spfa();
  }
  template <class heap>
  void _dijkstra(int s) {
    prevv.assign(V, -1);
    preve.assign(V, -1);
    dist.assign(V, INF_COST);
    dist[s] = 0;
    heap q;
    q.emplace(0, s);
    while (!q.empty()) {
      auto p = q.top();
      q.pop();
      int v = p.second;
      if (dist[v] < Cost(p.first)) continue;
      for (int i = 0; i < (int)g[v].size(); i++) {
        _edge &e = g[v][i];
        auto c = dist[v] + e.cost + dual[v] - dual[e.to];
        if (e.cap > 0 and dist[e.to] > c) {
          dist[e.to] = c, prevv[e.to] = v, preve[e.to] = i;
          q.emplace(dist[e.to], e.to);
        }
      }
    }
  }
  MinCostFlow(int V = 0) : _is_dual_infeasible(false), V(V), g(V), dual(V, 0) {
    static_assert(INF_COST > 0, "INF_COST must be positive");
  }
  int add_edge(int from, int to, Cap cap, Cost cost) {
    assert(0 <= from and from < V);
    assert(0 <= to and to < V);
    assert(cap >= 0);
    if (cost < 0) _is_dual_infeasible = true;
    pos.emplace_back(from, g[from].size());
    g[from].push_back({to, (int)g[to].size() + (from == to), cap, cost});
    g[to].push_back({from, (int)g[from].size() - 1, (Cap)0, -cost});
    return int(pos.size()) - 1;
  }
  using Pque = std::priority_queue<std::pair<Cost, int>,
                                   std::vector<std::pair<Cost, int>>,
                                   std::greater<std::pair<Cost, int>>>;
  template <class heap = Pque>
  std::pair<Cap, Cost> flow(int s, int t, const Cap &flow_limit) {
    if (!initialize_dual()) throw;
    Cost cost = 0;
    Cap flow_rem = flow_limit;
    while (flow_rem > 0) {
      _dijkstra<heap>(s);
      if (dist[t] == INF_COST) break;
      for (int v = 0; v < V; v++)
        dual[v] = std::min(dual[v] + dist[v], INF_COST);
      Cap d = flow_rem;
      for (int v = t; v != s; v = prevv[v])
        d = std::min(d, g[prevv[v]][preve[v]].cap);
      flow_rem -= d;
      cost += d * (dual[t] - dual[s]);
      for (int v = t; v != s; v = prevv[v]) {
        _edge &e = g[prevv[v]][preve[v]];
        e.cap -= d;
        g[v][e.rev].cap += d;
      }
    }
    return std::make_pair(flow_limit - flow_rem, cost);
  }
  struct edge {
    int from, to;
    Cap cap, flow;
    Cost cost;
    template <class Ostream>
    friend Ostream &operator<<(Ostream &os, const edge &e) {
      return os << '(' << e.from << "->" << e.to << ',' << e.flow << '/'
                << e.cap << ",$" << e.cost << ')';
    }
  };
  edge get_edge(int edge_id) const {
    int m = int(pos.size());
    assert(0 <= edge_id and edge_id < m);
    auto _e = g[pos[edge_id].first][pos[edge_id].second];
    auto _re = g[_e.to][_e.rev];
    return {pos[edge_id].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost};
  }
  std::vector<edge> edges() const {
    std::vector<edge> ret(pos.size());
    for (int i = 0; i < int(pos.size()); i++) ret[i] = get_edge(i);
    return ret;
  }
  template <class Ostream>
  friend Ostream &operator<<(Ostream &os, const MinCostFlow &mcf) {
    os << "[MinCostFlow]V=" << mcf.V << ":";
    for (int i = 0; i < mcf.V; i++) {
      for (auto &e : mcf.g[i])
        os << "\n" << i << "->" << e.to << ":cap" << e.cap << ",$" << e.cost;
    }
    return os;
  }
};
template <class Cap, class Cost, int SCALING = 1, int REFINEMENT_ITER = 20>
struct mcf_costscaling {
  mcf_costscaling() = default;
  mcf_costscaling(int n) : _n(n), to(n), b(n), p(n) {}
  int _n;
  std::vector<Cap> cap;
  std::vector<Cost> cost;
  std::vector<int> opposite;
  std::vector<std::vector<int>> to;
  std::vector<Cap> b;
  std::vector<Cost> p;
  int add_edge(int from_, int to_, Cap cap_, Cost cost_) {
    assert(0 <= from_ and from_ < _n);
    assert(0 <= to_ and to_ < _n);
    assert(0 <= cap_);
    cost_ *= (_n + 1);
    const int e = int(cap.size());
    to[from_].push_back(e);
    cap.push_back(cap_);
    cost.push_back(cost_);
    opposite.push_back(to_);
    to[to_].push_back(e + 1);
    cap.push_back(0);
    cost.push_back(-cost_);
    opposite.push_back(from_);
    return e / 2;
  }
  void add_supply(int v, Cap supply) { b[v] += supply; }
  void add_demand(int v, Cap demand) { add_supply(v, -demand); }
  template <typename RetCost = Cost>
  RetCost solve() {
    Cost eps = 1;
    std::vector<int> que;
    for (const auto c : cost) {
      while (eps <= -c) eps <<= SCALING;
    }
    for (; eps >>= SCALING;) {
      auto no_admissible_cycle = [&]() -> bool {
        for (int i = 0; i < _n; i++) {
          if (b[i]) return false;
        }
        std::vector<Cost> pp = p;
        for (int iter = 0; iter < REFINEMENT_ITER; iter++) {
          bool flg = false;
          for (int e = 0; e < int(cap.size()); e++) {
            if (!cap[e]) continue;
            int i = opposite[e ^ 1], j = opposite[e];
            if (pp[j] > pp[i] + cost[e] + eps)
              pp[j] = pp[i] + cost[e] + eps, flg = true;
          }
          if (!flg) return p = pp, true;
        }
        return false;
      };
      if (no_admissible_cycle()) continue;
      for (int e = 0; e < int(cap.size()); e++) {
        const int i = opposite[e ^ 1], j = opposite[e];
        const Cost cp_ij = cost[e] + p[i] - p[j];
        if (cap[e] and cp_ij < 0)
          b[i] -= cap[e], b[j] += cap[e], cap[e ^ 1] += cap[e], cap[e] = 0;
      }
      que.clear();
      int qh = 0;
      for (int i = 0; i < _n; i++) {
        if (b[i] > 0) que.push_back(i);
      }
      std::vector<int> iters(_n);
      while (qh < int(que.size())) {
        const int i = que[qh++];
        for (; iters[i] < int(to[i].size()) and b[i]; ++iters[i]) {
          int e = to[i][iters[i]];
          if (!cap[e]) continue;
          int j = opposite[e];
          Cost cp_ij = cost[e] + p[i] - p[j];
          if (cp_ij >= 0) continue;
          Cap f = b[i] > cap[e] ? cap[e] : b[i];
          if (b[j] <= 0 and b[j] + f > 0) que.push_back(j);
          b[i] -= f, b[j] += f, cap[e] -= f, cap[e ^ 1] += f;
        }
        if (b[i] > 0) {
          bool flg = false;
          for (int e : to[i]) {
            if (!cap[e]) continue;
            Cost x = p[opposite[e]] - cost[e] - eps;
            if (!flg or x > p[i]) flg = true, p[i] = x;
          }
          que.push_back(i), iters[i] = 0;
        }
      }
    }
    RetCost ret = 0;
    for (int e = 0; e < int(cap.size()); e += 2)
      ret += RetCost(cost[e]) * cap[e ^ 1];
    return ret / (_n + 1);
  }
  std::vector<Cost> potential() const {
    std::vector<Cost> ret = p, c0 = cost;
    for (auto &x : ret) x /= (_n + 1);
    for (auto &x : c0) x /= (_n + 1);
    while (true) {
      bool flg = false;
      for (int i = 0; i < _n; i++) {
        for (const auto e : to[i]) {
          if (!cap[e]) continue;
          int j = opposite[e];
          auto y = ret[i] + c0[e];
          if (ret[j] > y) ret[j] = y, flg = true;
        }
      }
      if (!flg) break;
    }
    return ret;
  }
  struct edge {
    int from, to;
    Cap cap, flow;
    Cost cost;
  };
  edge get_edge(int e) const {
    int m = cap.size() / 2;
    assert(e >= 0 and e < m);
    return {opposite[e * 2 + 1], opposite[e * 2], cap[e * 2] + cap[e * 2 + 1],
            cap[e * 2 + 1], cost[e * 2] / (_n + 1)};
  }
  std::vector<edge> edges() const {
    int m = cap.size() / 2;
    std::vector<edge> result(m);
    for (int i = 0; i < m; i++) result[i] = get_edge(i);
    return result;
  }
};
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> A(1 << N);
  cin >> A;
  vector<tuple<int, int, int>> aijs;
  for (int i = (0), i_end_ = (A.size()); i < i_end_; i++) {
    if (__builtin_parity(i)) continue;
    for (int d = (0), d_end_ = (N); d < d_end_; d++) {
      int j = i ^ (1 << d);
      aijs.emplace_back(A[i] + A[j], i, j);
    }
  }
  sort(aijs.rbegin(), aijs.rend());
  set<int> si[2];
  for (auto [a, i, j] : aijs) {
    si[0].insert(i);
    si[1].insert(j);
    if (si[0].size() > 4000 and si[1].size() > 4000) break;
  }
  vector<int> is(si[0].begin(), si[0].end());
  is.insert(is.end(), si[1].begin(), si[1].end());
  is = sort_unique(is);
  const int gs = is.size(), gt = gs + 1;
  mcf_costscaling<int, lint> mcf(gt + 1);
  for (int x = (0), x_end_ = (is.size()); x < x_end_; x++) {
    int i = is[x];
    int p = __builtin_parity(i);
    if (p) {
      mcf.add_edge(gs, x, 1, -A[i]);
      for (int d = (0), d_end_ = (N); d < d_end_; d++) {
        int j = i ^ (1 << d);
        int y = arglb(is, j);
        if (y < gs and is[y] == j) mcf.add_edge(x, y, 1, 0);
      }
    } else {
      mcf.add_edge(x, gt, 1, -A[i]);
    }
  }
  mcf.add_edge(gs, gt, K, 0);
  mcf.add_supply(gs, K);
  mcf.add_demand(gt, K);
  cout << -mcf.solve() << endl;
}

### Prompt

Your challenge is to write a CPP solution to the following problem:

There are currently n hot topics numbered from 0 to n-1 at your local bridge club and 2^n players numbered from 0 to 2^n-1. Each player holds a different set of views on those n topics, more specifically, the i-th player holds a positive view on the j-th topic if i\ \&\ 2^j > 0, and a negative view otherwise. Here \& denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND).

You are going to organize a bridge tournament capable of accommodating at most k pairs of players (bridge is played in teams of two people). You can select teams arbitrarily while each player is in at most one team, but there is one catch: two players cannot be in the same pair if they disagree on 2 or more of those n topics, as they would argue too much during the play.

You know that the i-th player will pay you a_i dollars if they play in this tournament. Compute the maximum amount of money that you can earn if you pair the players in your club optimally.

Input

The first line contains two integers n, k (1 ≤ n ≤ 20, 1 ≤ k ≤ 200) — the number of hot topics and the number of pairs of players that your tournament can accommodate.

The second line contains 2^n integers a_0, a_1, ..., a_{2^n-1} (0 ≤ a_i ≤ 10^6) — the amounts of money that the players will pay to play in the tournament.

Output

Print one integer: the maximum amount of money that you can earn if you pair the players in your club optimally under the above conditions.

Examples

Input


3 1
8 3 5 7 1 10 3 2


Output


13


Input


2 3
7 4 5 7


Output


23


Input


3 2
1 9 1 5 7 8 1 1


Output


29

Note

In the first example, the best we can do is to pair together the 0-th player and the 2-nd player resulting in earnings of 8 + 5 = 13 dollars. Although pairing the 0-th player with the 5-th player would give us 8 + 10 = 18 dollars, we cannot do this because those two players disagree on 2 of the 3 hot topics.

In the second example, we can pair the 0-th player with the 1-st player and pair the 2-nd player with the 3-rd player resulting in earnings of 7 + 4 + 5 + 7 = 23 dollars.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
  fast_ios() {
    cin.tie(nullptr), ios::sync_with_stdio(false),
        cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T, typename V>
void ndarray(vector<T> &vec, const V &val, int len) {
  vec.assign(len, val);
}
template <typename T, typename V, typename... Args>
void ndarray(vector<T> &vec, const V &val, int len, Args... args) {
  vec.resize(len),
      for_each(begin(vec), end(vec), [&](T &v) { ndarray(v, val, args...); });
}
template <typename T>
bool chmax(T &m, const T q) {
  return m < q ? (m = q, true) : false;
}
template <typename T>
bool chmin(T &m, const T q) {
  return m > q ? (m = q, true) : false;
}
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
  return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
  return make_pair(l.first - r.first, l.second - r.second);
}
template <typename T>
vector<T> sort_unique(vector<T> vec) {
  sort(vec.begin(), vec.end()),
      vec.erase(unique(vec.begin(), vec.end()), vec.end());
  return vec;
}
template <typename T>
int arglb(const std::vector<T> &v, const T &x) {
  return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x));
}
template <typename T>
int argub(const std::vector<T> &v, const T &x) {
  return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x));
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << '[';
  for (auto v : vec) os << v << ',';
  os << ']';
  return os;
}
template <typename T, size_t sz>
ostream &operator<<(ostream &os, const array<T, sz> &arr) {
  os << '[';
  for (auto v : arr) os << v << ',';
  os << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec) {
  os << "deq[";
  for (auto v : vec) os << v << ',';
  os << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T, typename TH>
ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
  os << '{';
  for (auto v : vec) os << v << ',';
  os << '}';
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
  os << '(' << pa.first << ',' << pa.second << ')';
  return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
  os << '{';
  for (auto v : mp) os << v.first << "=>" << v.second << ',';
  os << '}';
  return os;
}
template <typename TK, typename TV, typename TH>
ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) {
  os << '{';
  for (auto v : mp) os << v.first << "=>" << v.second << ',';
  os << '}';
  return os;
}
template <class Cap = long long, class Cost = long long,
          Cost INF_COST = std::numeric_limits<Cost>::max() / 2>
struct MinCostFlow {
  struct _edge {
    int to, rev;
    Cap cap;
    Cost cost;
    template <class Ostream>
    friend Ostream &operator<<(Ostream &os, const _edge &e) {
      return os << '(' << e.to << ',' << e.rev << ',' << e.cap << ',' << e.cost
                << ')';
    }
  };
  bool _is_dual_infeasible;
  int V;
  std::vector<std::vector<_edge>> g;
  std::vector<Cost> dist;
  std::vector<int> prevv, preve;
  std::vector<Cost> dual;
  std::vector<std::pair<int, int>> pos;
  bool _initialize_dual_dag() {
    std::vector<int> deg_in(V);
    for (int i = 0; i < V; i++) {
      for (const auto &e : g[i]) deg_in[e.to] += (e.cap > 0);
    }
    std::vector<int> st;
    st.reserve(V);
    for (int i = 0; i < V; i++) {
      if (!deg_in[i]) st.push_back(i);
    }
    for (int n = 0; n < V; n++) {
      if (int(st.size()) == n) return false;
      int now = st[n];
      for (const auto &e : g[now]) {
        if (!e.cap) continue;
        deg_in[e.to]--;
        if (deg_in[e.to] == 0) st.push_back(e.to);
        if (dual[e.to] >= dual[now] + e.cost) dual[e.to] = dual[now] + e.cost;
      }
    }
    return true;
  }
  bool _initialize_dual_spfa() {
    dual.assign(V, 0);
    std::queue<int> q;
    std::vector<int> in_queue(V);
    std::vector<int> nvis(V);
    for (int i = 0; i < V; i++) q.push(i), in_queue[i] = true;
    while (q.size()) {
      int now = q.front();
      q.pop(), in_queue[now] = false;
      if (nvis[now] > V) return false;
      nvis[now]++;
      for (const auto &e : g[now]) {
        if (!e.cap) continue;
        if (dual[e.to] > dual[now] + e.cost) {
          dual[e.to] = dual[now] + e.cost;
          if (!in_queue[e.to]) in_queue[e.to] = true, q.push(e.to);
        }
      }
    }
    return true;
  }
  bool initialize_dual() {
    return !_is_dual_infeasible or _initialize_dual_dag() or
           _initialize_dual_spfa();
  }
  template <class heap>
  void _dijkstra(int s) {
    prevv.assign(V, -1);
    preve.assign(V, -1);
    dist.assign(V, INF_COST);
    dist[s] = 0;
    heap q;
    q.emplace(0, s);
    while (!q.empty()) {
      auto p = q.top();
      q.pop();
      int v = p.second;
      if (dist[v] < Cost(p.first)) continue;
      for (int i = 0; i < (int)g[v].size(); i++) {
        _edge &e = g[v][i];
        auto c = dist[v] + e.cost + dual[v] - dual[e.to];
        if (e.cap > 0 and dist[e.to] > c) {
          dist[e.to] = c, prevv[e.to] = v, preve[e.to] = i;
          q.emplace(dist[e.to], e.to);
        }
      }
    }
  }
  MinCostFlow(int V = 0) : _is_dual_infeasible(false), V(V), g(V), dual(V, 0) {
    static_assert(INF_COST > 0, "INF_COST must be positive");
  }
  int add_edge(int from, int to, Cap cap, Cost cost) {
    assert(0 <= from and from < V);
    assert(0 <= to and to < V);
    assert(cap >= 0);
    if (cost < 0) _is_dual_infeasible = true;
    pos.emplace_back(from, g[from].size());
    g[from].push_back({to, (int)g[to].size() + (from == to), cap, cost});
    g[to].push_back({from, (int)g[from].size() - 1, (Cap)0, -cost});
    return int(pos.size()) - 1;
  }
  using Pque = std::priority_queue<std::pair<Cost, int>,
                                   std::vector<std::pair<Cost, int>>,
                                   std::greater<std::pair<Cost, int>>>;
  template <class heap = Pque>
  std::pair<Cap, Cost> flow(int s, int t, const Cap &flow_limit) {
    if (!initialize_dual()) throw;
    Cost cost = 0;
    Cap flow_rem = flow_limit;
    while (flow_rem > 0) {
      _dijkstra<heap>(s);
      if (dist[t] == INF_COST) break;
      for (int v = 0; v < V; v++)
        dual[v] = std::min(dual[v] + dist[v], INF_COST);
      Cap d = flow_rem;
      for (int v = t; v != s; v = prevv[v])
        d = std::min(d, g[prevv[v]][preve[v]].cap);
      flow_rem -= d;
      cost += d * (dual[t] - dual[s]);
      for (int v = t; v != s; v = prevv[v]) {
        _edge &e = g[prevv[v]][preve[v]];
        e.cap -= d;
        g[v][e.rev].cap += d;
      }
    }
    return std::make_pair(flow_limit - flow_rem, cost);
  }
  struct edge {
    int from, to;
    Cap cap, flow;
    Cost cost;
    template <class Ostream>
    friend Ostream &operator<<(Ostream &os, const edge &e) {
      return os << '(' << e.from << "->" << e.to << ',' << e.flow << '/'
                << e.cap << ",$" << e.cost << ')';
    }
  };
  edge get_edge(int edge_id) const {
    int m = int(pos.size());
    assert(0 <= edge_id and edge_id < m);
    auto _e = g[pos[edge_id].first][pos[edge_id].second];
    auto _re = g[_e.to][_e.rev];
    return {pos[edge_id].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost};
  }
  std::vector<edge> edges() const {
    std::vector<edge> ret(pos.size());
    for (int i = 0; i < int(pos.size()); i++) ret[i] = get_edge(i);
    return ret;
  }
  template <class Ostream>
  friend Ostream &operator<<(Ostream &os, const MinCostFlow &mcf) {
    os << "[MinCostFlow]V=" << mcf.V << ":";
    for (int i = 0; i < mcf.V; i++) {
      for (auto &e : mcf.g[i])
        os << "\n" << i << "->" << e.to << ":cap" << e.cap << ",$" << e.cost;
    }
    return os;
  }
};
template <class Cap, class Cost, int SCALING = 1, int REFINEMENT_ITER = 20>
struct mcf_costscaling {
  mcf_costscaling() = default;
  mcf_costscaling(int n) : _n(n), to(n), b(n), p(n) {}
  int _n;
  std::vector<Cap> cap;
  std::vector<Cost> cost;
  std::vector<int> opposite;
  std::vector<std::vector<int>> to;
  std::vector<Cap> b;
  std::vector<Cost> p;
  int add_edge(int from_, int to_, Cap cap_, Cost cost_) {
    assert(0 <= from_ and from_ < _n);
    assert(0 <= to_ and to_ < _n);
    assert(0 <= cap_);
    cost_ *= (_n + 1);
    const int e = int(cap.size());
    to[from_].push_back(e);
    cap.push_back(cap_);
    cost.push_back(cost_);
    opposite.push_back(to_);
    to[to_].push_back(e + 1);
    cap.push_back(0);
    cost.push_back(-cost_);
    opposite.push_back(from_);
    return e / 2;
  }
  void add_supply(int v, Cap supply) { b[v] += supply; }
  void add_demand(int v, Cap demand) { add_supply(v, -demand); }
  template <typename RetCost = Cost>
  RetCost solve() {
    Cost eps = 1;
    std::vector<int> que;
    for (const auto c : cost) {
      while (eps <= -c) eps <<= SCALING;
    }
    for (; eps >>= SCALING;) {
      auto no_admissible_cycle = [&]() -> bool {
        for (int i = 0; i < _n; i++) {
          if (b[i]) return false;
        }
        std::vector<Cost> pp = p;
        for (int iter = 0; iter < REFINEMENT_ITER; iter++) {
          bool flg = false;
          for (int e = 0; e < int(cap.size()); e++) {
            if (!cap[e]) continue;
            int i = opposite[e ^ 1], j = opposite[e];
            if (pp[j] > pp[i] + cost[e] + eps)
              pp[j] = pp[i] + cost[e] + eps, flg = true;
          }
          if (!flg) return p = pp, true;
        }
        return false;
      };
      if (no_admissible_cycle()) continue;
      for (int e = 0; e < int(cap.size()); e++) {
        const int i = opposite[e ^ 1], j = opposite[e];
        const Cost cp_ij = cost[e] + p[i] - p[j];
        if (cap[e] and cp_ij < 0)
          b[i] -= cap[e], b[j] += cap[e], cap[e ^ 1] += cap[e], cap[e] = 0;
      }
      que.clear();
      int qh = 0;
      for (int i = 0; i < _n; i++) {
        if (b[i] > 0) que.push_back(i);
      }
      std::vector<int> iters(_n);
      while (qh < int(que.size())) {
        const int i = que[qh++];
        for (; iters[i] < int(to[i].size()) and b[i]; ++iters[i]) {
          int e = to[i][iters[i]];
          if (!cap[e]) continue;
          int j = opposite[e];
          Cost cp_ij = cost[e] + p[i] - p[j];
          if (cp_ij >= 0) continue;
          Cap f = b[i] > cap[e] ? cap[e] : b[i];
          if (b[j] <= 0 and b[j] + f > 0) que.push_back(j);
          b[i] -= f, b[j] += f, cap[e] -= f, cap[e ^ 1] += f;
        }
        if (b[i] > 0) {
          bool flg = false;
          for (int e : to[i]) {
            if (!cap[e]) continue;
            Cost x = p[opposite[e]] - cost[e] - eps;
            if (!flg or x > p[i]) flg = true, p[i] = x;
          }
          que.push_back(i), iters[i] = 0;
        }
      }
    }
    RetCost ret = 0;
    for (int e = 0; e < int(cap.size()); e += 2)
      ret += RetCost(cost[e]) * cap[e ^ 1];
    return ret / (_n + 1);
  }
  std::vector<Cost> potential() const {
    std::vector<Cost> ret = p, c0 = cost;
    for (auto &x : ret) x /= (_n + 1);
    for (auto &x : c0) x /= (_n + 1);
    while (true) {
      bool flg = false;
      for (int i = 0; i < _n; i++) {
        for (const auto e : to[i]) {
          if (!cap[e]) continue;
          int j = opposite[e];
          auto y = ret[i] + c0[e];
          if (ret[j] > y) ret[j] = y, flg = true;
        }
      }
      if (!flg) break;
    }
    return ret;
  }
  struct edge {
    int from, to;
    Cap cap, flow;
    Cost cost;
  };
  edge get_edge(int e) const {
    int m = cap.size() / 2;
    assert(e >= 0 and e < m);
    return {opposite[e * 2 + 1], opposite[e * 2], cap[e * 2] + cap[e * 2 + 1],
            cap[e * 2 + 1], cost[e * 2] / (_n + 1)};
  }
  std::vector<edge> edges() const {
    int m = cap.size() / 2;
    std::vector<edge> result(m);
    for (int i = 0; i < m; i++) result[i] = get_edge(i);
    return result;
  }
};
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> A(1 << N);
  cin >> A;
  vector<tuple<int, int, int>> aijs;
  for (int i = (0), i_end_ = (A.size()); i < i_end_; i++) {
    if (__builtin_parity(i)) continue;
    for (int d = (0), d_end_ = (N); d < d_end_; d++) {
      int j = i ^ (1 << d);
      aijs.emplace_back(A[i] + A[j], i, j);
    }
  }
  sort(aijs.rbegin(), aijs.rend());
  set<int> si[2];
  for (auto [a, i, j] : aijs) {
    si[0].insert(i);
    si[1].insert(j);
    if (si[0].size() > 4000 and si[1].size() > 4000) break;
  }
  vector<int> is(si[0].begin(), si[0].end());
  is.insert(is.end(), si[1].begin(), si[1].end());
  is = sort_unique(is);
  const int gs = is.size(), gt = gs + 1;
  mcf_costscaling<int, lint> mcf(gt + 1);
  for (int x = (0), x_end_ = (is.size()); x < x_end_; x++) {
    int i = is[x];
    int p = __builtin_parity(i);
    if (p) {
      mcf.add_edge(gs, x, 1, -A[i]);
      for (int d = (0), d_end_ = (N); d < d_end_; d++) {
        int j = i ^ (1 << d);
        int y = arglb(is, j);
        if (y < gs and is[y] == j) mcf.add_edge(x, y, 1, 0);
      }
    } else {
      mcf.add_edge(x, gt, 1, -A[i]);
    }
  }
  mcf.add_edge(gs, gt, K, 0);
  mcf.add_supply(gs, K);
  mcf.add_demand(gt, K);
  cout << -mcf.solve() << endl;
}

```