#include <algorithm>
#include <iostream>
using namespace std;

int main() {
	int quota, m;
	cin >> quota >> m;
	
    int dust[m];
    for (int i = 0; i < m; i++) {
		cin >> dust[i];
	}
    
	sort(dust, dust+m);
    
	int ans = 0x7FFFFFFF;
	for (int i = 0; i <= m - quota; i++) {
		if (dust[i] * dust[i+quota-1] >= 0) {
			ans = min(ans, max(abs(dust[i]), abs(dust[i+quota-1])));
		} else {
			ans = min(ans, abs(dust[i] - dust[i+quota-1]) + min(abs(dust[i]), abs(dust[i+quota-1])));
		}
	}
	cout << ans << endl;
	return 0;
}