
149  The 2017 China Collegiate Programming Contest, Qinhuangdao Site  B
DreamGrid is a famous coach of competitive programming. He is so kind that many competitors are willing to ask him for advice. DreamGrid meets exactly \(n\) competitors every day in his office, and thus \(n\) "arriving" events and \(n\) "selecting" events will happen. An arriving event at time \(t\) indicates that a competitor arrives at the waiting room of the office at time \(t\), and a selecting event at time \(t\) indicates that DreamGrid randomly selects (with equal probability) a competitor from the waiting room to talk with. Of course, if the selecting event happens, the waiting room must not be empty. After the talk, the competitor leaves the office and never comes back. After several days, DreamGrid starts to be curious about the average of the total expected waiting time of every competitor in all valid cases. The waiting time of a competitor is the time he is selected by DreamGrid minus the time he arrives at the waiting room. A case is a sequence of length \(2n\) consisting of \(n\) arriving events and \(n\) selecting events, where the \(i\)th event will happen at time \(a_i\). For a valid case, it must be satisfied that when a selecting event happens, the waiting room must not be empty. For example, let's denote an arriving event as 'A', and a selecting event as 'S'. If \(n = 2\), \(a_1 = 1\), \(a_2 = 2\), \(a_3 = 3\) and \(a_4 = 4\), then the sequence "AASS" is valid, but the sequence "ASSA" is not valid, as the "selecting" event happening at time \(a_3 = 3\) is not valid. As the answer may not be an integer, you are supposed to calculate \(ab^{1}\) mod \(p\), where \(\frac{a}{b}\) (\(a\) and \(b\) are coprime) is the answer, \(p > 2n\) and \(p\) is prime, and \(b^{1}\) is the modular multiplicative inverse of \(b\) with respect to the modulus \(p\). It's easy to prove that the prime factors of \(b\) will never be larger than \(2n\). InputThere are multiple test cases. The first line of input contains an integer \(T\) (\(1 \le T \le 10^4\)), indicating the number of test cases. For each test case: The first line contains five integers \(n\), \(p\), \(b_0\), \(A\), \(B\) (\(1 \le n \le 10^6, 2n < p \le 2 \times 10^9\), \(0 \le b_0, A, B < p\)), where \(p\) is a prime number. The meanings of \(n\) and \(p\) are described above. The rest of them is a generator of \(a\), where \(a_0 = 0\), \(a_i = a_{i1} + b_i + 1\) and \(b_{i} = (A \cdot b_{i  1} + B) \mod p\) for all \(1 \le i \le 2n\). It is guaranteed that the sum of \(n\) in all test cases does not exceed \(10^7\). OutputFor each test case, output one integer denoting the answer in a single line. Sample Input5 1 1000000007 0 1 0 2 1000000007 0 1 1 2 7 5 2 3 3 31 15 6 24 20 1000000007 0 1 0 Sample Output1 12 1 21 879705565 HintLet's denote the arriving event as 'A', and the selecting event as 'S'. In the first test case, we have \(a_1 = 1\) and \(a_2 = 2\), and there is only one valid sequence "AS". The waiting time of the only competitor is 21 = 1, so the answer is 1, and we need to output 1 mod 1000000007 = 1. In the second test case, we have \(a_1 = 2\), \(a_2 = 5\), \(a_3 = 9\) and \(a_4 = 14\). There are two valid sequences "ASAS" and "AASS". For the first sequence, the expected waiting time of the first arriving competitor is 52 = 3, and the expected waiting time of the second arriving competitor is 149 = 5. For the second sequence, the expected waiting time of the first arriving competitor is ((92)+(142))/2 = 9.5, and the expected waiting time of the second arriving competitor is ((95)+(145))/2 = 6.5. So the answer is ((3+5)+(9.5+6.5))/2 = 12, and we need to output 12 mod 1000000007 = 12. In the third test case, we have \(a_1 = 7\), \(a_2 = 9\), \(a_3 = 15\) and \(a_4 = 22\). Just like the analysis for the 2nd sample test case, the total expected waiting time for the sequence "ASAS" is (97)+(2215) = 9, and the total expected waiting time for the sequence "AASS" is ((157)+(227))/2+((159)+(229))/2 = 21. So the answer is (9+21)/2 = 15, and we need to output 15 mod 7 = 1. 