Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 41707		Accepted: 14125

People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch. 
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins. 

The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.

For each test case output the answer on a single line.

//It is made by HolseLee on 17th May 2018

//POJ 1742

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cmath>

#include<iostream>

#include<iomanip>

#include<algorithm>

#define Fi(i,a,b) for(int i=a;i<=b;i++)

#define Fx(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

const int N=1e5+;bool dp[N];

int n,m,cnt,ans,k[N],a[],c[];

int main()

{

  ios::sync_with_stdio(false);

  while(cin>>n>>m){

    if(!n||!m)break;

    memset(dp,false,sizeof(dp));

    dp[]=true;cnt=;ans=;

    Fi(i,,n)cin>>a[i];Fi(i,,n)cin>>c[i];

    Fi(i,,n){

      for(int j=;j<=c[i];j<<=){

    k[++cnt]=a[i]*j;c[i]-=j;}

      if(c[i])k[++cnt]=a[i]*c[i];}

    Fi(i,,cnt)Fx(j,m,k[i]){

      dp[j]|=dp[j-k[i]];}

    Fi(i,,m)if(dp[i])ans++;

    cout<<ans<<"\n";}

  return ;

}