else downvote. We should call an integer cluster a1,a2,… ,a decent if ai≠i for every I. Let F(a) be the number of sets (i,j) (1≤i
C++ only. Do not copy. Correct code will upvoted else downvote.
We should call an integer cluster a1,a2,… ,a decent if
• For all j and k (j < k): aij > a(i+1)j
• If i is even then, for all j and k (j < k) : aij > aik .
• If i is odd then, for all j and k (j < k) : aij < aik.
Here is an example of 3×4 Snake array
25 23 20 19
13 15 17 18
12 10 9 8
Input
l≤ai≤r for every I;
F(a) is the most extreme conceivable among all great varieties of size n.
Given n, l and r, work out the number of superb exhibits modulo 109+7
Input
The primary line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The sole line of each experiment contains three integers n, l, and r (2≤n≤2⋅105; −109≤l≤1; n≤r≤109).
It's reliable that the amount of n doesn't surpass 2⋅105.
Output
For each experiment, print the number of phenomenal clusters modulo 109+
Step by step
Solved in 3 steps with 1 images
