A. Creating a Character（Educational Codeforces Round 72 (Rated for Div. 2) ）

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

int main()

{

    int cnt,n,m,k;

    while(cin>>n)

 {

        while(n--)

 {

            cin>>m>>k>>cnt;

            cout<1)/2 , 0 ) , cnt+1 )<<endl;            

}

}

    ok;

} 

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

int main()

{

    int cnt,n,m,k;

    while(cin>>n)

 {

        while(n--)

 {

            cin>>m>>k>>cnt;

            cout<1)/2 , 0 ) , cnt+1 )<<endl;            

}

}

    ok;

} 

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

int main()

{

    int cnt,n,m,k;

    while(cin>>n)

 {

        while(n--)

 {

            cin>>m>>k>>cnt;

            cout<1)/2 , 0 ) , cnt+1 )<<endl;            

}

}

    ok;

} 

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

You play your favourite game yet another time. You chose the character you didn‘t play before. It has str

“>strstr points of strength and int

“>intint points of intelligence. Also, at start, the character has exp

“>expexp free experience points you can invest either in strength or in intelligence (by investing one point you can either raise strength by 1

“>11 or raise intelligence by 1

“>11).

Since you‘d like to make some fun you want to create a jock character, so it has more strength than intelligence points (resulting strength is strictly greater than the resulting intelligence).

Calculate the number of different character builds you can create (for the purpose of replayability) if you must invest all free points. Two character builds are different if their strength and/or intellect are different.

The first line contains the single integer T

“>TT (1≤T≤100

“>1≤T≤1001≤T≤100) — the number of queries. Next T

“>TT lines contain descriptions of queries — one per line.

This line contains three integers str

“>strstr, int

“>intint and exp

“>expexp (1≤str,int≤108

“>1≤str,int≤1081≤str,int≤108, 0≤exp≤108

“>0≤exp≤1080≤exp≤108) — the initial strength and intelligence of the character and the number of free points, respectively.

Input

Print T

“>TT integers — one per query. For each query print the number of different character builds you can create.

Output

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

Example

4

5 3 4

2 1 0

3 5 5

4 10 6

3

1

2

0

4

5 3 4

2 1 0

3 5 5

4 10 6

input

Copy

3

1

2

0

output

Copy

In the first query there are only three appropriate character builds: (str=7,int=5)

“>(str=7,int=5)(str=7,int=5), (8,4)

“>(8,4)(8,4) and (9,3)

“>(9,3)(9,3). All other builds are either too smart or don‘t use all free points.

In the second query there is only one possible build: (2,1)

“>(2,1)(2,1).

In the third query there are two appropriate builds: (7,6)

“>(7,6)(7,6), (8,5)

“>(8,5)(8,5).

In the fourth query all builds have too much brains.

Note

int main()

{

    int cnt,n,m,k;

    while(cin>>n)

 {

        while(n--)

 {

            cin>>m>>k>>cnt;

            cout<1)/2 , 0 ) , cnt+1 )<<endl;            

}

}

    ok;

}