Donia's sister baked some cookies, and she $$$-$$$ for some reason $$$-$$$ will not let her eat them. Some of the cookies were large, and others were small. Donia wants to eat as many large cookies as she can but without making her sister notice.
Donia's sister will not notice if at least $$$m$$$ cookies haven't been eaten.
Help Donia and tell her the maximum number of large cookies she can eat without making her sister notice.
The first line contains $$$T$$$ $$$(1 \leq T \leq 10^{5})-$$$ the number of test cases.
The only line of each test case contains the integers $$$n$$$, $$$m$$$, $$$a$$$ $$$(1\leq m,a \leq n \leq 10^{12})- $$$the number of cookies Donia's sister baked and the minimum number of cookies Donia has to leave, the number of large cookies.
For each test case, output one integer $$$-$$$ the maximum number of large cookies Donia can eat.
35 2 15 2 25 5 5
1 2 0
In the first test, Donia has to leave at least $$$2$$$ cookies, and there is only $$$1$$$ large cookie, so she will eat it and leave $$$4$$$ cookies.