Uva 11517

#include <bits/stdc++.h>

#define FOR(i, s, e) for(int i=s; i<e; i++)
#define loop(i, n) for(int i=0; i<n; i++)
#define getint(n) scanf("%d", &n)
#define pb(a) push_back(a)
#define ll long long int
#define dd double
#define SZ(a) int(a.size())
#define read() freopen("input.txt", "r", stdin)
#define write() freopen("output.txt", "w", stdout)
#define mem(a, v) memset(a, v, sizeof(a))
#define all(v) v.begin(), v.end()
#define pi acos(-1.0)
#define pf printf
#define sf scanf
#define mp make_pair
#define paii pair<int, int>
#define padd pair<dd, dd>
#define pall pair<ll, ll>
#define fr first
#define sc second
#define getlong scanf("%lld",&n)
#define CASE(n) printf("Case %d: ",++n)
#define inf 1000000
#define EPS 1e-9

using namespace std;

int fx[]={0,0,1,-1,1,1,-1,-1};
int fy[]={1,-1,0,0,1,-1,1,-1};

int main()
{
    int t,cas=0;
    cin>>t;
    int dp[20005],coin[105];
    while(t--)
    {
        int tk,n,maxi=0;
        cin>>tk>>n;
        loop(i,n){
        cin>>coin[i];
        maxi=max(maxi,coin[i]);
        }
        mem(dp,inf);
        dp[0]=0;
        for(int i=0;i<n;i++)
        {
            for(int j=coin[i];j<=maxi+tk;j++){
                dp[j]=min(dp[j],dp[j-coin[i]]+1);
            }
        }
        for(int i=tk;i<=maxi+tk;i++)
        {
            if(dp[i]<inf){
                cout<<i<<" "<<dp[i]<<endl;
                break;
            }
        }
    }
    return 0;
}