#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t a, b, c;
    cin >> a >> b >> c;
    int32_t ans = numeric_limits<int32_t>::max();
    for (auto ai = 0; ai <= a; ++ai) {
        for (auto bi = 0; bi <= b; ++bi) {
            for (auto i = 1; i <= ai + bi * 10; ++i) {
                auto r = ai + bi * 10 - i;
                if (r / 10 + r % 10 + (a - ai) + (b - bi) == c) {
                    ans = min(ans, i);
                }
            }
        }
    }
    if (ans == numeric_limits<int32_t>::max()) {
        cout << "Impossible" << endl;
    } else {
        cout << ans << endl;
    }
    return 0;
}