#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

bool dp[1001][1001];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int c,n; cin >> c >> n;
    dp[0][0] = true;
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        int a; cin >> a;
        for (int j = min(c, sum); j >= 0; --j) {
            for (int k = min(c, sum-j); k >= 0; --k) {
                if (!dp[j][k]) continue;
                if (j+a <= c) dp[j+a][k] = true;
                if (k+a <= c) dp[j][k+a] = true;
            }
        }
        sum += a;
    }
    int mx = 0;
    pair<int,int> p = {0, 0};
    for (int i = 0; i <= c; ++i) {
        for (int j = 0; j <= i; ++j) {
            if (dp[i][j]) {
                if (mx < i+j) {
                    mx = i+j;
                    p = {i, j};
                }
                else if (mx == i+j) {
                    if (abs(p.first-p.second) > abs(i-j)) {
                        p = {i, j};
                    }
                }
            }
        }
    }
    cout << p.first << " " << p.second << endl;
}