#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N, M;
int D[1000];

int main(int argc, char **argv) {
	cin >> N >> M;
	REP(i, M) cin >> D[i];
	sort(D, D + M);
	int z = (int)(lower_bound(D, D + M, 0) -D);
	int res = 1000000;
	REP(i, M - N + 1) {
		if (i + N < z || i - N >= z) continue;
		int l = (i >= z) ? 0 : abs(D[i]);
		int r = (i + N <= z) ? 0 : D[i + N - 1];
		res = min(res, min(l * 2 + r, l + r * 2));
	}
	cout << res << endl;
	return 0;
}