#include <bits/stdc++.h>
using namespace std;
#define uint unsigned long long
#define int long long
#define endl '\n'
const int N = 1e4 + 5;
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX

struct node
{
    int a, b;
    bool operator<(const node &x) const
    {
        return a < x.a;
    }
};
int ar[N], br[N], ans = -1;
void solve()
{
    int n, m, ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> ar[i], ar[i + n] = ar[i];
    for (int i = 1; i <= n; i++)
        cin >> br[i], br[i + n] = br[i];

    for (int len = 1; len <= n; len++)
    {
        for (int l = 1, r = len; r <= 2 * n; l++, r++)
        {
            int have = m - min(abs(n - l + 1), abs(n - r - 1)) - len + 1;
            
            priority_queue<node> q;
            int sum = 0;
            for (int i = l; i <= r; i ++)
                q.push({ar[i], br[i]});
            for (int i = 1; i <= have && !q.empty(); i++)
            {
                auto x = q.top();
                q.pop();
                if(x.a <= 0)
                    break;
                sum += x.a;
                x.a -= x.b;
                q.push(x);
            }
            ans = max(ans, sum);
        }
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    solve();
    return 0;
}