import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    static Map<Long, Long> dp = new HashMap<>();
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        dp.put(0L, 0L);
        dp.put(1L, 1L);
        dp.put(2L, 2L);
        long prev = sc.nextLong();
        long ans = 0;
        for (int i = 1; i < m; i++) {
            long x = sc.nextLong();
            ans += dfw(x - prev - 1);
            prev = x;
        }
        System.out.println(ans);
    }
    
    static long dfw(long x) {
        if (!dp.containsKey(x)) {
            if (x % 2 == 0) {
                dp.put(x, x);
            } else {
                dp.put(x, dfw(x / 2) * 2);
            }
        }
        return dp.get(x);
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}