a, b, c = map(int, input().split())

min_price = None

def sum_digits(x):
    return sum(map(int, str(x)))

for U in range(a + 1):
    for V in range(b + 1):
        S = U + 10 * V
        if S == 0:
            continue  # can't buy anything
        C_prime = c - (a + b - U - V)
        if C_prime < 0:
            continue
        # Find maximum x <= S-1 such that sum_digits(x) == C_prime
        # Iterate x from S-1 down to 0
        found = False
        for x in range(S-1, -1, -1):
            if sum_digits(x) == C_prime:
                found = True
                break
        if found:
            P = S - x
            if P <= 0:
                continue  # invalid price
            if (min_price is None) or (P < min_price):
                min_price = P

if min_price is not None:
    print(min_price)
else:
    print("Impossible")