Problem: The biggest event of the year – Cota 2 world championship "The Innernational" is right around the corner. 2^n teams will compete in a double-elimination format (please, carefully read problem statement even if you know what is it) to identify the champion. 

Teams are numbered from 1 to 2^n and will play games one-on-one. All teams start in the upper bracket.

All upper bracket matches will be held played between teams that haven't lost any games yet. Teams are split into games by team numbers. Game winner advances in the next round of upper bracket, losers drop into the lower bracket.

Lower bracket starts with 2^{n-1} teams that lost the first upper bracket game. Each lower bracket round consists of two games. In the first game of a round 2^k teams play a game with each other (teams are split into games by team numbers). 2^{k-1} loosing teams are eliminated from the championship, 2^{k-1} winning teams are playing 2^{k-1} teams that got eliminated in this round of upper bracket (again, teams are split into games by team numbers). As a result of each round both upper and lower bracket have 2^{k-1} teams remaining. See example notes for better understanding.

Single remaining team of upper bracket plays with single remaining team of lower bracket in grand-finals to identify championship winner.

You are a fan of teams with numbers a_1, a_2, ..., a_k. You want the championship to have as many games with your favourite teams as possible. Luckily, you can affect results of every championship game the way you want. What's maximal possible number of championship games that include teams you're fan of?

Input

First input line has two integers n, k — 2^n teams are competing in the championship. You are a fan of k teams (2 ≤ n ≤ 17; 0 ≤ k ≤ 2^n).

Second input line has k distinct integers a_1, …, a_k — numbers of teams you're a fan of (1 ≤ a_i ≤ 2^n).

Output

Output single integer — maximal possible number of championship games that include teams you're fan of.

Examples

Input


3 1
6


Output


6


Input


3 3
1 7 8


Output


11


Input


3 4
1 3 5 7


Output


14

Note

On the image, each game of the championship is denoted with an English letter (a to n). Winner of game i is denoted as Wi, loser is denoted as Li. Teams you're a fan of are highlighted with red background.

In the first example, team 6 will play in 6 games if it looses the first upper bracket game (game c) and wins all lower bracket games (games h, j, l, m). 

<image>

In the second example, teams 7 and 8 have to play with each other in the first game of upper bracket (game d). Team 8 can win all remaining games in upper bracket, when teams 1 and 7 will compete in the lower bracket. 

<image>

In the third example, your favourite teams can play in all games of the championship. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int inline read() {
  int num = 0, neg = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') neg = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    num = (num << 3) + (num << 1) + c - '0';
    c = getchar();
  }
  return num * neg;
}
const int maxn = 100010, mod = 998244353;
int n, k, f[1 << 18][2][2], a[1 << 17];
void dfs(int x, int l, int r) {
  if (l == r - 1) {
    f[x][0][1] = f[x][1][0] = f[x][1][1] = -2147483647 / 3;
    if (a[l] && a[r]) f[x][1][1] = 1;
    if (a[l] || a[r])
      f[x][1][0] = 1, f[x][0][1] = 1, f[x][0][0] = -2147483647 / 3;
    return;
  }
  int mid = l + r >> 1;
  dfs((x << 1), l, mid);
  dfs((x << 1 | 1), mid + 1, r);
  f[x][0][0] = f[x][0][1] = f[x][1][0] = f[x][1][1] = -2147483647 / 3;
  for (int i = 0; i <= 1; i++)
    for (int j = 0; j <= 1; j++)
      for (int i1 = 0; i1 <= 1; i1++)
        for (int j1 = 0; j1 <= 1; j1++)
          for (int t = 0; t <= 7; t++) {
            int t1, t2, s = 0, fail1, fail2;
            if (t & 1)
              t1 = i, fail1 = i1;
            else
              t1 = i1, fail1 = i;
            s += (i | i1);
            if ((t >> 1) & 1)
              fail2 = j;
            else
              fail2 = j1;
            s += (j | j1);
            if ((t >> 2) & 1)
              t2 = fail1;
            else
              t2 = fail2;
            s += (fail1 | fail2);
            f[x][t1][t2] = max(f[x][t1][t2],
                               f[(x << 1)][i][j] + f[(x << 1 | 1)][i1][j1] + s);
          }
}
int main() {
  n = read();
  k = read();
  if (!k) {
    cout << 0;
    return 0;
  }
  for (int i = 1; i <= k; i++) {
    int x = read() - 1;
    a[x] = 1;
  }
  dfs(1, 0, (1 << n) - 1);
  cout << max(f[1][0][0],
              max(f[1][0][1] + 1, max(f[1][1][0] + 1, f[1][1][1] + 1)));
  return 0;
}