def recursiveChocolateFeast(wrapper,m):
    if wrapper<m:
        return 0
    return wrapper//m +recursiveChocolateFeast(wrapper//m+wrapper%m,m)
    
def chocolateFeast(n, c, m):
    return n//c +recursiveChocolateFeast(n//c,m)

def chocolateFeast(n, c, m):
    # Write your code here
    res =n//c
    wrapper =res
    while wrapper>=m:
        temp = wrapper%m
        wrapper //=m
				res +=wrapper
        wrapper +=temp
		return res