#include <fstream>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream fin("linka.in");
ofstream fout("linka.out");
int N,Q,A[200],list[200],Fare,Min=~0u>>1;
bool used[200];
void Initialize()
{
int i;
	fin>>N>>Q;
	for(i=1;i<=Q;i++)
		fin>>A[i];
	sort(A+1,A+Q+1);
}
 
void DFS(int deep)
{
int i,j,flag;
	if(deep==Q)
	{
		Min=min(Min,Fare);
		return;
	}
	if(Fare>=Min)
		return ;
	deep++;
	for(i=1;i<=Q;i++)
		if(!used[i])
		{
			j=1;flag=Fare;
			while(list[j]<A[i] && j<deep)
				j++;
			if(j==deep)
				Fare+=N-list[j-1]-1;
			else
				Fare+=list[j]-list[j-1]-1;
			list[deep]=A[i];
			used[i]=true;
			DFS(deep);
			used[i]=false;
			Fare=flag;
		}
}
 
int main()
{
	Initialize();
	
	list[0]=1;
	DFS(0);
	
	fout<<Min<<endl;
	
	fin.close();
	fout.close();
	return 0;
}