#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <list>
#include <map>
#include <queue>
#include <iterator>
using namespace std;

using ull = unsigned long long;
using ll = long long;

int main()
{
    int n,m;
    cin >> n >> m;

    vector<int> data(20002);
    vector<int> indexs(m);
    for(int i = 0; i < m; ++i)
    {
        int n;
        cin >> n;
        data.at(10000 + n) = 1;
        indexs.at(i) = n;
    }

    indexs.emplace_back(0);
    sort(indexs.begin(),indexs.end());

    int minimum = 1000000;
    for(auto&& x : indexs)
    {
        int neg_max = 0;
        int plus_max = 0;

        if(x > 0)   break;
        neg_max = min(neg_max,x);
        int count = 0;
        int s = 0;
        bool check = false;

        for(int i = 10000 + x; i < data.size(); ++i)
        {
            if(data.at(i) == 1)
            {
                 ++count;
                 if(i > 10000)  plus_max = max(plus_max,i-10000);
            }
            if(count == n)
            {
                if(i < 10000)
                    s+= abs(i-10000);
                check = true;
                int res = min(plus_max,abs(neg_max));
                s += res;
                break;
            }
            ++s;
        }

        if(check)
            minimum = min(minimum,s);
        check = false;
    }

    cout << minimum<< endl;
}