MOVIFAN  Movie Fan
Alice is a cinephile. He wanted to watch a recently released movie. There are many movie shows whose start time and length are given.Your task is to help Alice count the number of ways he can watch the movie. Since he is a cinephile, he can watch many shows as long as they do not overlap.
Input
First line contains an integer t denotine number of test cases.
Each test case contains n,l denoting number of shows and length of the shows.
n integer follows denoting start time of show.
1<=t<=10
1<=n,l<=300000
Output
Print the number of ways Alice can watch shows if he want to watch atleast one show modulo 1000000007.
Example
Input: 3
3 4
3 8 12
3 1
1 2 3
3 3
3 5 9 Output: 7
7
5
For testcase1 ,Alice can watch 1 show in 3 ways,2 shows in 3 ways and 3 show in 1 way total ways=7
For test case3 Alice can watch 1 show in 3 ways, 2 shows in 2 ways ,total ways=5
hide comments
hodobox:
20170418 21:45:42
start times seem to be given in sorted order, and are smaller than 10^6 

Chinmay Kousik:
20161122 11:33:20
Solve ACTIV after this 

Vipul Srivastava:
20161116 16:42:34
Constraints on start times?? 
Added by:  Umesh Malhotra 
Date:  20161112 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU 