"Sometimes the thing that brings us together also pulls us apart." - Jarod Kintz.

Shivam and Shantam are really good friends. What mostly brings them together is the hours of group study they have done in the two years of their engineering, and there is only more to add to this. They both start studying together for exams , and keep explaining topics and clearing each other's slightest of doubts.

But , unfortunately , marks and money can always make or break relations. Both of them have to answer N questions in tomorrow's paper. We also have two arrays , A and B. A_i denotes the marks Shivam will get if he answers the i^th question. B_i denotes the marks Shantam will get if he answers the i^th question. The person not choosing to answer the question would get no marks.

Obviously , there are many ways in which they can give their papers. Let the final score of Shivam be S and that of Shantam be K. We are interested in knowing the number of ways such that the absolute difference in S and K is less than or equal to Q.

Input Format :

The first line contains N , the number of questions. The next line contains N space separated integers denoting A_i , the marks that Shivam can score if he attempts the i^th question. The next line contains N space separated integers denoting B_i , the marks that Shantam can score if he attempts the i^th question. The next line contains Q , the maximum allowed absolute difference.

Output Format :

Since the number of ways can be huge , output the answer modulo 10⁹ + 7 in a separate line.

Contraints :

1 ≤ N ≤ 200
0 ≤ A_i, B_i ≤ 2 * 10³
0 ≤ Q ≤ 10^6