#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("electric.in");
ofstream fout("electric.out");
long long a[100005], sp[100005];
int main()
{
   long long C, n;
   fin >> C >> n;

    for(long long i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    sort(a + 1, a+n + 1);

    if(a[1] > C)
    {
        fout << 0 << " " << 0;
        return 0;
    }

    sp[1] = a[1];
    for(int i = 2; i <= n; i++)
    {
        sp[i] = a[i] - a[i - 1];
    }
    long long stops = 0, dist = 0;
    for(int i = 1; i <= n; i++)
    {
        if(a[i] > C)
        {
            if(a[i - 1] <= C)
            {
                stops++;
                dist += a[i - 1];
                a[i] = sp[i];

            }

        }

    }
    dist += C;
    fout << dist << " " << stops;


}