def solution (a, b, n):
	 
	i = 0
	while i * a <= n: 
		if (n - (i * a)) % b == 0: 
			return ("x = ",i ,", y = ", 
			int((n - (i * a)) / b)) 
			return 0
		i = i + 1
	return ("No solution") 
def solution(a, b, n):
    n2 = 0
    while n2 * a <= n:
        if (n - (n2 * a)) % b == 0:
           
            return ("x = ", n2, ", y = ", int((n - (n2 * a)) / b))
            return 0
        n2 = n2 + 1
    return "No solution"