def solution(a, b, n):
    def egcd(x, y):
        if y == 0:
            return abs(x), 1 if x > 0 else -1 if x < 0 else 0, 0
        g, s, t = egcd(y, x % y)
        return g, t, s - (x // y) * t

    if a == 0 and b == 0:
        return (0, 0) if n == 0 else None
    if a == 0:
        if b != 0 and n % b == 0:
            return (0, n // b)
        return None
    if b == 0:
        if a != 0 and n % a == 0:
            return (n // a, 0)
        return None

    g, x0, y0 = egcd(a, b)
    if n % g != 0:
        return None

    k = n // g
    return (x0 * k, y0 * k)