#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

typedef bitset<1001> bs;
int main()
{
  int c, n; cin>>c>>n;
  vi B(n);
  FOR(i,n) cin>>B[i];
  vi A;
  for(int x: B) 
    if(x<=c) A.pb(x);

  sort(A.begin(), A.end());
  n = A.size();
  if(n==0) {
    cout<<"0 0\n";
    return 0;
  }
  vector<vector<bs>> dp(n, vector<bs>(c+1));
  dp[0][0][A[0]] = 1;
  dp[0][A[0]][0] = 1;
  for(int i=1;i<n;i++) {
    for(int j=0;j<=c;j++) {
      dp[i][j] |= dp[i-1][j];
      if(j>=A[i]) dp[i][j] |= dp[i-1][j-A[i]];
      bs temp = dp[i-1][j];
      temp = temp << A[i];
      dp[i][j] |= temp;
    }
  }
  pii best = make_pair(0,0);

  for(int i=0;i<=c;i++) {
    for(int j=0;j<=c;j++) {
      if(dp[n-1][i][j]) {
        assert(dp[n-1][i][j] == dp[n-1][j][i]);
        int s1 = best.f + best.s;
        int d1 = abs(best.f - best.s);

        int s2 = i + j;
        int d2 = abs(i-j);
        if(s1 < s2) {
          best = make_pair(i, j);
        }
        else if(s1==s2 && d1 > d2) {
          best = make_pair(i, j);
        }
      }
    }
  }
  cout<<max(best.f, best.s)<<" "<<min(best.f, best.s)<<endl;

  return 0;
}