时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld
题目描述
In ICPCCamp, candies are in different sizes.
There are f(i) (defined below) distinct types of candies of i grams where
%20%3D%20%5Cleft%5C%7B%5Cbegin%7Barray%7D%7Bll%7D%0Aa_i%20%26%20%5Cmathrm%7Bfor%7D%5C%201%20%5Cleq%20i%20%5Cleq%20n%20%5C%5C%0A%5Csum_%7Bj%20%3D%201%7D%5En%20c_j%20%5Ccdot%20f(i%20-%20j)%20%26%20%5Cmathrm%7Bfor%7D%5C%20i%20%3E%20n%20%5C%5C%0A%5Cend%7Barray%7D%5Cright..)
Bobo would like to buy some candies whose sum of weight is m grams and align them in a row.
Find the number of different ways modulo)
.
Note that two ways are different if they differs in the types or in the order of alignment.
There are f(i) (defined below) distinct types of candies of i grams where
Bobo would like to buy some candies whose sum of weight is m grams and align them in a row.
Find the number of different ways modulo
Note that two ways are different if they differs in the types or in the order of alignment.
输入描述:
The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains two integers n and m.
The second line contains n integers.
The third line contains n integers.
输出描述:
For each test case, print an integer which denotes the result.
备注:
*
*
*
* The number of test cases does not exceed 10.