#SDNU1494. Problem_C

Problem_C

Description

ChaoChao, a lonely boy, has bought a Galaxy Note 7 and wants to destroy cities.
There are NN cities numbered 1...N1... N on a line and each pair of adjacent cities has distance 1. Galaxy Note 7 has its explosion radius RR.
ChaoChao puts her Galaxy Note 7 in city XX and city ii will be destroyed if (∣X−i∣≤R)(|X−i| \leq R).You must tell ChaoChao how many cities wil be destroyed.(viva Flaming Fire Force!!!)

Format

Input

The first line contains a positive integer TT, the number of test cases.
Each of the following T lines contains three integers N,R,XN, R, X.
1≤T,N≤1001 \leq T,N \leq 100,0≤R≤1000 \leq R \leq 100,1≤X≤N1 \leq X \leq N

Output

TT lines.Each line contains one integer, the answer.

Samples

3
100 5 23
100 8 36
100 9 99
11
17
11