#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
int n, m;
int a[N], b[N];
int get(int x, int y)
{
    return max(0ll, a[x] - (y - 1) * b[x]);
}
int dis(int l, int r)
{
    if (l == 1)
        return r - l;
    return min(r - n + 1, n - l + 1) + r - l;
}
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i], a[i + n] = a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i], b[i + n] = b[i];
    auto in = [&](int l, int r)
    {
        if (l <= 1 && 1 <= r)
            return true;
        if (l <= n && n <= r)
            return true;
        return false;
    };

    int ans = 0;
    for (int i = 1; i <= 2 * n; i++)
    {
        for (int j = i; j <= 2 * n; j++)
        {
            if (!in(i, j) || (j - i + 1) > n)
                continue;
            priority_queue<array<int, 3>> q;
            for (int k = i; k <= j; k++)
                q.push({get(k, 1), k, 1});
            int t = m - dis(i, j);
            int tmp = 0;
            for (int k = 1; k <= t; k++)
            {
                auto [w, id, cnt] = q.top();
                q.pop();
                tmp += w;
                q.push({get(id, cnt + 1), id, cnt + 1});
            }
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}