#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T, N;
    cin >> T >> N;
    vector<int> c(N), v(N);
    for(int i = 0; i < N; ++i)  cin >> c[i];
    for(int i = 0; i < N; ++i)  cin >> v[i];

    vector<vector<int>> dp(N + 1, vector<int>(T + 1, -1));
    dp[0][0] = 0;
    for(int i = 0; i < N; ++i){
        for(int j = 0; j <= T; ++j){
            if(dp[i][j] == -1)  continue;
            chmax(dp[i + 1][j], dp[i][j]);
            int nv = v[i], sum = v[i];
            for(int k = c[i]; j + k <= T; k += c[i]){
                chmax(dp[i + 1][j + k], dp[i][j] + sum);
                if((nv /= 2) == 0)  break;
                sum += nv;
            }
        }
    }

    cout << *max_element(begin(dp[N]), end(dp[N])) << endl;

    return 0;
}