多重背包

//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <stdio.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x , y) memset(x , y , sizeof(x))
#define SF(n) scanf("%d" , &n)
#define rep(i , n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 1000000007
#define PI acos(-1)
using namespace std;
typedef long long ll ;
int a[109] , b[109] , val[100009];
int dp[100009];

int main()
{
    /*#ifdef ONLINE_JUDGE
    #else
        freopen("D:/c++/in.txt", "r", stdin);
        freopen("D:/c++/out.txt", "w", stdout);
    #endif*/
    int n , v ;
    while(~scanf("%d%d" , &n , &v) && n+v)
    {
        for(int i = 1 ; i <= n ; i++)
        {
            scanf("%d" , &a[i]);
        }
        for(int i = 1 ; i <= n ; i++)
        {
            scanf("%d" , &b[i]);
        }
        memset(dp , 0 , sizeof(dp));
        int l = 1 ;
        for(int i = 1 ; i <= n ; i++)
        {
            int c = 1;
            while(b[i] - c > 0)
            {
                val[l++] = c * a[i];
                b[i] -= c ;
                c *= 2 ;
            }
            val[l++] = b[i] * a[i];
        }
        for(int i = 1 ; i < l ; i++)
        {
            for(int j = v ; j >= val[i] ; j--)
            {
                dp[j] = max(dp[j] , dp[j-val[i]]+val[i]);
            }
        }
        int ans = 0 ;
        for(int i = 1 ; i <= v ; i++)
        {
            if(dp[i] == i)
            {
                ans ++ ;
            }
        }
        cout << ans << endl ;
    }



    return 0 ;
}