// Original: https://github.com/tanakh/competitive-rs
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

/** Example:
 * input!(n: usize, s: chars, vs: [i64; n], ts: [(i64, f64); n]);
 * usize型の変数n, String型(実際は文字配列型)のs, Vector<i64>型のvs, tuple配列のtsに読み込まれる。
 */
fn main() {
    input!(one: usize, ten: usize, c: usize);

    let sum = one + ten;
    let max_price = one + (ten * 10);

    let mut ans = 1_000_000_000;
    for price in 1..max_price + 1 {
        for i in 0..one + 1 {
            for j in 0..ten + 1 {
                let pay = i + j * 10;
                if pay < price {
                    continue;
                }
                let ret = pay - price;
                let tsuri = ret / 10 + ret % 10;
                if sum - i - j + tsuri == c {
                    ans = std::cmp::min(ans, price);
                }
            }
        }
    }

    if ans == 1_000_000_000 {
        println!("{}", "Impossible");
    } else {
        println!("{}", ans);
    }
}