hackerrank:Chocolate Feast

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int t = in.nextInt();
for(int i = 0; i < t; i++)
{
System.out.println(Solve(in.nextInt(), in.nextInt(), in.nextInt()));
}
}
private static long Solve(int N, int C, int M)
{
int toffes=N/C;
int paper=toffes;
int extra=0;
while(paper>0)
{
paper=paper-M;
if(paper>=0)
extra++;
if(paper>0)
paper=paper+1;
}  
return toffes+extra;
}
}