#include<iostream>

#include<cmath>

#include<algorithm>

#include<cstdio>

#include<cstring>

using namespace std;

const int INF = 0x3f3f3f3f;

int n, m;

int f[][], g[][];

int p[];

int main(){

    while(~scanf("%d%d", &n, &m) && n+m){

        for(int i=; i<=m; ++i)

            scanf("%d", &p[i]);

        memset(f, , sizeof(f));

        for(int i=; i<=m; ++i){

            f[i-][] = INF;

            for(int j=; j<=n; ++j){

                f[i][j] = f[i-][j];

                for(int k=; k<=j; ++k){

                    f[i][j] = max(f[i][j], min(f[i-][j-k], p[i]/k));

                }

            }

        }

        memset(g, INF, sizeof(g));

        for(int i=; i<=m; ++i){

            g[i-][] = ;

            for(int j=; j<=n; ++j){

                g[i][j] = g[i-][j];

                for(int k=; k<=j; ++k){

                    int s = p[i]/k;

                    if(s >= f[m][n]){

                        g[i][j] = min(g[i][j], g[i-][j-k]+p[i]);

                    }

                }

            }

        }

        printf("%d %d\n", f[m][n], f[m][n]==?:g[m][n]);

    }

    return ;

}