def solution(a, b, n):
    def extended_gcd(x, y):
        old_r, r = x, y
        old_s, s = 1, 0
        old_t, t = 0, 1

        while r != 0:
            q = old_r // r
            old_r, r = r, old_r - q * r
            old_s, s = s, old_s - q * s
            old_t, t = t, old_t - q * t

        return old_r, old_s, old_t

    gcd_value, x0, y0 = extended_gcd(a, b)

    if n % gcd_value != 0:
        return None

    factor = n // gcd_value
    return x0 * factor, y0 * factor