Tim is an absolutely obsessive soda drinker, he simply cannot get enough. Most annoyingly though, he almost never has any money, so his only obvious legal way to obtain more soda is to take the money he gets when he recycles empty soda bottles to buy new ones. In addition to the empty bottles resulting from his own consumption he sometimes find empty bottles in the street. One day he was extra thirsty, so he actually drank sodas until he couldn’t afford a new one.
The first line of the input file contains an integer N (N < 15) which denotes the total number of test cases. The description of each test case is given below:
Three non-negative integers e, f , c, where e < 1000 equals the number of empty soda bottles in Tim’s possession at the start of the day, f < 1000 the number of empty soda bottles found during the day, and 1 < c < 2000 the number of empty bottles required to buy a new soda.
For each test case print how many sodas did Tim drink on his extra thirsty day? Look at the sample output for details.
範例輸入 1
2 9 0 3 5 5 2
範例輸出 1
4 9
Pro 專屬功能： 查看這題在歷屆 CPE 出現過幾次 — 升級以解鎖.