#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	int TT,N;
	cin>>TT>>N;
	int c[15],v[15];
	vector<PII> vec;
	vec.reserve(15);
	rep(i,N){cin>>c[i];}
	rep(i,N){cin>>v[i];}
	rep(i,N){
		vec.push_back(PII(c[i],v[i]));
	}
	sort( vec.begin(), vec.end(), greater<PII>() );
	int T[15];
	int sumV[15];
	int ans=0,tans;
	T[0] = TT;
	for(int  i0=0; 0<N&& i0*vec[ 0].first<=T[ 0]; ++i0){sumV[ 0] = 0;rep(i, i0){sumV[ 0] += vec[ 0].second >> i;}
	if( 1==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[1] = T[ 0]- i0*vec[ 0].first;
	for(int  i1=0; 1<N&& i1*vec[ 1].first<=T[ 1]; ++i1){sumV[ 1] = 0;rep(i, i1){sumV[ 1] += vec[ 1].second >> i;}
	if( 2==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[2] = T[ 1]- i1*vec[ 1].first;
	for(int  i2=0; 2<N&& i2*vec[ 2].first<=T[ 2]; ++i2){sumV[ 2] = 0;rep(i, i2){sumV[ 2] += vec[ 2].second >> i;}
	if( 3==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[3] = T[ 2]- i2*vec[ 2].first;
	for(int  i3=0; 3<N&& i3*vec[ 3].first<=T[ 3]; ++i3){sumV[ 3] = 0;rep(i, i3){sumV[ 3] += vec[ 3].second >> i;}
	if( 4==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[4] = T[ 3]- i3*vec[ 3].first;
	for(int  i4=0; 4<N&& i4*vec[ 4].first<=T[ 4]; ++i4){sumV[ 4] = 0;rep(i, i4){sumV[ 4] += vec[ 4].second >> i;}
	if( 5==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[5] = T[ 4]- i4*vec[ 4].first;
	for(int  i5=0; 5<N&& i5*vec[ 5].first<=T[ 5]; ++i5){sumV[ 5] = 0;rep(i, i5){sumV[ 5] += vec[ 5].second >> i;}
	if( 6==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[6] = T[ 5]- i5*vec[ 5].first;
	for(int  i6=0; 6<N&& i6*vec[ 6].first<=T[ 6]; ++i6){sumV[ 6] = 0;rep(i, i6){sumV[ 6] += vec[ 6].second >> i;}
	if( 7==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[7] = T[ 6]- i6*vec[ 6].first;
	for(int  i7=0; 7<N&& i7*vec[ 7].first<=T[ 7]; ++i7){sumV[ 7] = 0;rep(i, i7){sumV[ 7] += vec[ 7].second >> i;}
	if( 8==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[8] = T[ 7]- i7*vec[ 7].first;
	for(int  i8=0; 8<N&& i8*vec[ 8].first<=T[ 8]; ++i8){sumV[ 8] = 0;rep(i, i8){sumV[ 8] += vec[ 8].second >> i;}
	if( 9==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[9] = T[ 8]- i8*vec[ 8].first;
	for(int  i9=0; 9<N&& i9*vec[ 9].first<=T[ 9]; ++i9){sumV[ 9] = 0;rep(i, i9){sumV[ 9] += vec[ 9].second >> i;}
	if(10==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[10] = T[ 9]- i9*vec[ 9].first;
	for(int i10=0;10<N&&i10*vec[11].first<=T[10];++i10){sumV[10] = 0;rep(i,i10){sumV[10] += vec[10].second >> i;}
	if(11==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[11] = T[10]-i10*vec[10].first;
	for(int i11=0;11<N&&i11*vec[12].first<=T[11];++i11){sumV[11] = 0;rep(i,i11){sumV[11] += vec[11].second >> i;}
	if(12==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[12] = T[11]-i11*vec[11].first;
	for(int i12=0;12<N&&i12*vec[13].first<=T[12];++i12){sumV[12] = 0;rep(i,i12){sumV[12] += vec[12].second >> i;}
	if(13==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[13] = T[12]-i12*vec[12].first;
	for(int i13=0;13<N&&i13*vec[14].first<=T[13];++i13){sumV[13] = 0;rep(i,i13){sumV[13] += vec[13].second >> i;}
	if(14==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	T[14] = T[13]-i13*vec[13].first;
	for(int i14=0;14<N&&i14*vec[15].first<=T[14];++i14){sumV[14] = 0;rep(i,i14){sumV[14] += vec[14].second >> i;}
	if(15==N){tans=0;rep(i,N){tans += sumV[i];}ans=max(ans,tans);}
	}}}}}}}}}}}}}}}
	P(ans);
	return 0;
}