#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll a, b, c, d, ans = INF;
int main() {
	cin >> a >> b >> c;
	REP(i, a + 1) {
		REP(j, b + 1) {
			if (i == 0 and j == 0)continue;
			ll now = a + b - i - j;
			ll nn = now;
			if (c == now) ans = min(ans, i + j * 10);
			REP(k, i / 10) {
				now++;
				if (c == now) ans = min(ans, i + j * 10 - (k + 1) * 10);
			}
			if (j >= 1) {
				REPO(k, 9) {
				 if (c == nn + k) ans = min(ans, i + j * 10 - k);
				}
			}
		}
	}
	if (ans == INF) cout << "Impossible" << endl;
	else cout << ans << endl;
}