import sympy as sp

def minimal$\_$non$\_$negative$\_$x$($A$,$ P$,$ M$)$:

x $=$ sp$.$symbols$(\text{'}$x$\text{'})$

# Convert the input expression to a symbolic expression

expr $=$ sp$.$sympify$($A$)$

# Find the remainder when the expression is divided by M

expr$\_$mod $=$ sp$.$Mod$($expr$,$ M$)$

# Solve the equation expr$\_$mod $=$ P

solutions $=$ sp$.$solveset$($sp$.$Eq$($expr$\_$mod, P$),$ x$,$ domain$=$sp$.$S$.$Integers$)$

# Find the minimal non$-$negative integer solution

min$\_$non$\_$negative$\_$solution $=$ None

for sol in solutions:

if sol $>=0$:

if min$\_$non$\_$negative$\_$solution is None or sol $<$ min$\_$non$\_$negative$\_$solution:

min$\_$non$\_$negative$\_$solution $=$ sol

return min$\_$non$\_$negative$\_$solution

# Read input

A $=$ input$().$strip$()$

P$,$ M $=$ map$($int$,$ input$().$split$())$

# Find and print the minimal non$-$negative value of variable x

result $=$ minimal$\_$non$\_$negative$\_$x$($A$,$ P$,$ M$)$

print$($result$)$