#include <iostream>
using namespace std;
#define MAX 7501
int main()
{
int dp[21][MAX]={0};//30*25*20+1
int points[21];
int weights[21];
int points_num = 0;//可以挂物品的钩子的位置数量
int weights_sum = 0;//可以选择的悬挂物品的数量
cin >> points_num >> weights_sum;
for(int i = 0 ; i < points_num ; i ++)
cin >> points[i];
for(int i = 0 ; i < weights_sum ; i ++)
cin >> weights[i];
dp[0][3750] = 1;
for(int i = 1 ; i <= weights_sum ; i ++)
{
for(int j = 0 ; j < MAX ; j ++)
{
if(dp[i-1][j]!=0)
{
for(int k = 0 ; k < points_num ; k ++)
dp[i][j + points[k]*weights[i-1]] += dp[i-1][j];
}
}
}
cout << dp[weights_sum][3750] << endl;
return 0;
}
using namespace std;
#define MAX 7501
int main()
{
int dp[21][MAX]={0};//30*25*20+1
int points[21];
int weights[21];
int points_num = 0;//可以挂物品的钩子的位置数量
int weights_sum = 0;//可以选择的悬挂物品的数量
cin >> points_num >> weights_sum;
for(int i = 0 ; i < points_num ; i ++)
cin >> points[i];
for(int i = 0 ; i < weights_sum ; i ++)
cin >> weights[i];
dp[0][3750] = 1;
for(int i = 1 ; i <= weights_sum ; i ++)
{
for(int j = 0 ; j < MAX ; j ++)
{
if(dp[i-1][j]!=0)
{
for(int k = 0 ; k < points_num ; k ++)
dp[i][j + points[k]*weights[i-1]] += dp[i-1][j];
}
}
}
cout << dp[weights_sum][3750] << endl;
return 0;
}