INF = 10 ** 9
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  collections import deque

def main():
    a,b,c = map(int,input().split())
    ans = INF
    for i in range(1,a + 10 * b + 1):
        for j in range(a + 1):
            for k in range(b + 1):
                if j + 10 * k - i >= 0 and a - j + b - k + sum(divmod(j + 10 * k - i,10)) == c:
                    ans = min(ans,i)
    if ans == INF:
        print('Impossible')
    else:
        print(ans)

if __name__ == '__main__':
    main()