#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
#include <numeric>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,Nof(a))
#define found(s,e) ((s).find(e)!=(s).end())

typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mdi;


int main(){
	int n,k;
	cin >> n >> k;
	vector<int> v(k);
	for(int i=0;i<k;i++){
		cin >> v[i];
	}
	sort(v.begin(),v.end());
	int res=1e9;
	for(int i=0; i<=k-n; i++){
		res = min(res, max(0, v[i + n -1])*2 - min(0,v[i]));
		res = min(res, max(0, v[i + n -1]) - min(0,v[i])*2);
	}
	cout << res << endl;
	return 0;
}