def solution(X, Y, D): # write your code in Python 3.6 init_count = ((Y-X)//D) total_d = 0 while True: total_d = D*init_count if (total_d+X) >= Y: break init_count += 1 return init_count