#include<iostream>

 #include<algorithm>

 #include<stdio.h>

 #include<string.h>

 using namespace std;

 int dp[],a1[],a[],b[];

 int main()

 {

     int n,m,i,j,k,s,cout1;

     while(scanf("%d%d",&n,&m)!=EOF)

     {

         if(n==&&m==)

             break;

         for(i=;i<n;i++)

             scanf("%d",&a[i]);

         for(i=;i<n;i++)

             scanf("%d",&b[i]);

         cout1=;

         for(i=;i<n;i++)

         {

             for(k=;k<=b[i];k<<=)

             {

                 a1[cout1++]=k*a[i];

                 b[i]-=k;

             }

             if(b[i]>)

                 a1[cout1++]=b[i]*a[i];

         }

         memset(dp,,sizeof(dp));

         for(i=;i<cout1;i++)

             for(j=m;j>=a1[i];j--)

             dp[j]=max(dp[j],dp[j-a1[i]]+a1[i]);

         s=;

         for(i=;i<=m;i++)

             if(dp[i]==i)

             s++;

         printf("%d\n",s);

     }

     return ;

 }