#include <cstdio>

#include <algorithm>

using namespace std;

const int N=1010;

struct data{long long a,b;}p[N];

int n,m,k;

bool cmp(data a,data b){return a.a*1000000-a.b*m>b.a*1000000-b.b*m;}

bool check(int x){

    m=x;

    sort(p+1,p+n+1,cmp);

    long long cnt=0;

    for(int i=1;i<=k;i++)cnt+=p[i].a*1000000-p[i].b*x;

    return cnt>=0;

}

int main(){

    while(~scanf("%d%d",&n,&k),n+k){

        k=n-k;

        for(int i=1;i<=n;i++)scanf("%lld",&p[i].a);

        for(int i=1;i<=n;i++)scanf("%lld",&p[i].b);

        int l=0,r=1000000,ans;

        while(l<=r){

            int mid=(l+r)>>1;

            if(check(mid))l=mid+1,ans=mid;

            else r=mid-1;

        }printf("%d\n",ans/10000+(ans%10000>=5000));

    }return 0;

}