#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int t,n;
vector<int> c,v;
vector<int> dpv[20001];
int dp[20001];

void solve(){
	dpv[0] = v;
	for(int i = 1;i<10000;i++)dpv[i] = vector<int>(n);
	for(int i = 0;i<10000;i++){
		for(int j = 0;j<n;j++){
			if(dp[i+c[j]]< dp[i] + dpv[i][j]){
				auto nv = dpv[i];
				nv[j] = nv[j]/2;
				dp[i+c[j]] = dp[i] + dpv[i][j];
				dpv[i+c[j]] = nv;
			}
		}
	}
	int ans = 0;
	for(int i = 0 ;i<=t;i++){
		ans = max(dp[i],ans);
	}
	cout<<ans<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> t >> n;
	c = v = vector<int>(n);
	for(int i = 0;i<n;i++)cin >> c[i];
	for(int i = 0;i<n;i++)cin >> v[i];
	solve();
}