/*
TASK: skok
LANG: C++
*/
#include<iostream>
#include<vector>
using namespace std;
int main()
{
    int N,M,rm,ind;
    int i,j;
    vector<int> A,jumps,D;
    cin>>N>>M;
    jumps.resize(M);A.resize(N+1);
    D.resize(N+1);
    for(i=0;i<jumps.size();i++)cin>>jumps[i];
    for(i=0;i<A.size();i++)cin>>A[i];
    D[0]=A[0];
    for(i=1;i<D.size();i++)
    {
        D[i]=0;
        rm=0;
        for(j=0;j<jumps.size();j++)
        {
            if(i-jumps[j]>=0&&D[i-jumps[j]]+A[i]>rm)rm=D[i-jumps[j]]+A[i];
        }
        D[i]=rm;
    }
    rm=0;ind=0;
    for(i=0;i<D.size();i++)
    {
        if(D[i]>rm)
        {
            rm=D[i];
            ind=i;
        }
    }
    cout<<rm<<' '<<ind<<'\n';
    return 0;
}
