H - Coins

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int f[101000];
int c[105];
int num[105];
int n,V;
void ZeroOnePack(int cost,int weight)
{
    for(int v=V;v>=cost;v--)
        f[v]=max(f[v],f[v-cost]+weight);
}
void CompletePack(int cost,int weight)
{
    for(int v=cost;v<=V;v++)
        f[v]=max(f[v],f[v-cost]+weight);
}
void MultiplePack(int cost,int weight,int amount)
{
    if(cost*amount>=V)
    {
        CompletePack(cost,weight);
        return;
    }
    int k=1;
    while(k<amount)
    {
        ZeroOnePack(k*cost,k*weight);
        amount=amount-k;
        k=k*2;
    }
    ZeroOnePack(amount*cost,amount*weight);
}
int main()
{
    while(scanf("%d%d",&n,&V)&&n!=0&&V!=0)
    {
        for(int i=1;i<=n;i++)
            scanf("%d",&c[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&num[i]);
        memset(f,0,sizeof(f));
        for(int i=1;i<=n;i++)
            MultiplePack(c[i],c[i],num[i]);
        int ans=0;
        for(int i=1;i<=V;i++)
            if(f[i]==i)ans++;
        printf("%d\n",ans);
    }
}