![]() |
||||||||||
|
||||||||||
Jumping FrogTime Limit: 21000/21000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 639 Accepted Submission(s): 163 Problem Description
Moriya Suwako is training by frog-leaping up and down the shrine stairs. The staircase consists of N steps. On the way up, Suwako can take any of some specified steps at a time. On the way down, she can take any of some other specified steps at a time, and she can only walk on the steps she used on the way up. How many different paths are available for her training? ![]() Input There are multiple test cases. Process to the End of File. Each test case contains three lines of integers as follows: N U A1 A2 ... AU D B1 B2 ... BD N is the total number of steps. Ai is the number of steps that can be taken on the way up, all Ais are different. Bi is the number of steps that can be taken on the way down, all Bis are different. 1 ≤ N ≤ 1018 1 ≤ U, D ≤ 50 1 ≤ Ai, Bi ≤ 200 Output For each test case, output the number of paths module 1,000,000,007. Sample Input
Sample Output
Author Zejun Wu (watashi) Source | ||||||||||
|