#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<algorithm>

using namespace std;

typedef long long LL;

LL h[],a[];

LL s,t,L;int n;

bool check(LL x)

{

    LL sum=;

    for(int i=;i<=n;i++) if(h[i]+a[i]*x>=L) sum+=h[i]+a[i]*x;

    if(sum>=s) return true;

    else return false;

}

int main()

{

    scanf("%d%lld%lld",&n,&s,&L);

    for(int i=;i<=n;i++) scanf("%lld",&h[i]);

    LL mx=;

    for(int i=;i<=n;i++){scanf("%lld",&a[i]);mx=max(mx,a[i]);}

    LL l=,r=+max(s,L)/mx,mid,ans;

    while(l<=r)

    {

        mid=(l+r)/;

        if(check(mid)==true)

        {

            ans=mid;

            r=mid-;

        }

        else l=mid+;

    }

    printf("%lld\n",ans);

    return ;

}