Coins

3 10
1 2 4 2 1 1
2 5
1 4 2 1
0 0

8
4

//499MS	1444K
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 100007
using namespace std;
int dp[M],val[107],num[107],m;
int n;
void ZeroOnePack(int value)
{
    for(int i=m;i>=value;i--)
        dp[i]=max(dp[i],dp[i-value]+value);
}
void CompletePack(int value)
{
    for(int i=value;i<=m;i++)
        dp[i]=max(dp[i],dp[i-value]+value);
}
void MultiplePack(int count,int value)
{
    if(count*value>m)CompletePack(value);
    else
    {
        int k=1;
        while(k<count)
        {
            ZeroOnePack(k*value);
            count-=k;
            k<<=1;
        }
        ZeroOnePack(count*value);
    }
}
int main()
{
    while(scanf("%d%d",&n,&m),n|m)
    {
        int ans=0,k=0;
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
            scanf("%d",&val[i]);
        for(int i=1;i<=n;i++)
            scanf("%d",&num[i]);
        for(int i=1;i<=n;i++)
            MultiplePack(num[i],val[i]);
        for(int i=1;i<=m;i++)
            if(dp[i]==i)ans++;
        printf("%d\n",ans);
    }
}