|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||71||34||25||49.020%|
A young boy got really curious about binary strings. This string contains only 1s and 0s hence the name binary. His particular interest was about those strings for which no two ones are side by side. Specifically he wanted to know the number of strings of a certain length that consisted of only ones and zeroes and there are no two consecutive ones.
After solving this problem, the young boy got even more curious. Now he wants to know the number of binary strings which satisfies the following properties:
Now can you help him to find out the number of strings that satisfies the above conditions? Since the number can be huge, you need to print it modulo 1 000 000 007.
The first line is an integer T (1 ≤ T ≤ 10 000), the number of tests. In the next T lines there are three integers L, R and K.
Print T lines, in each line print the case id and the result modulo 1 000 000 007. See the samples for more details.
2 1 10 3 1 10 5
Case 1: 115 Case 2: 157
For the first case some example strings are “101”, “000”, “010” “101001”, “000010000” etc.