/*
TASK:skok
LANG:C++
*/

#include<iostream>

using namespace std;

long app[200009],n;
int skokove[256],m;
int last;
long sum,big;

int main() {
    cin>>n>>m;
    for(int i=0;i<m;i++) cin>>skokove[i];
    cin>>app[0];sum=app[0];last=0;
    for(int i=1;i<=n;i++) {
            cin>>app[i];
            big=-1;
            for(int j=0;j<m;j++) 
                    if (skokove[j]<=i&&big<app[i-skokove[j]]) big=app[i-skokove[j]];
            if(big!=-1)app[i]+=big; else app[i]=-1;
            if(app[i]>sum) {sum=app[i];last=i;}
    }
    cout<<sum<<' '<<last<<endl;
    return 0;
}
