#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int main()
{
    int t,N;
    cin>>t>>N;
    VI c(N);
    VI v(N);
    FOR(i,N) cin>>c[i];
    FOR(i,N) cin>>v[i];
    VI dp(t + 1);
    FOR(i,N){
        int fun = v[i];
        while(fun){
            for(int j=t;j-c[i]>=0;j--){
                dp[j] = max(dp[j], dp[j-c[i]] + fun);
            }
            fun /= 2;
        }
    }
    cout<<*max_element(ALL(dp))<<endl;
    return 0;
}