#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #if defined(_MSC_VER) || defined(ONLINE_JUDGE) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif #define rep(i, n) for(int i=0; i<(n); ++i) #define FOR(i, m, n) for(int i=(m); i<(n); ++i) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define mp make_pair #define pb push_back #define dump(x) cerr << #x << " = " << (x) << endl; using namespace std; using LL=long long; using VI=vector; using VL=vector; using VS=vector; using VD=vector; using VVI=vector; using VVL=vector; using PII=pair; using PLL=pair; const int inf = (int)1e9; const double pi = acos(-1.0); const LL MOD = 1000000007; const string Snum = "0123456789"; const int dx[] = { -1,0,1,0,-1,-1,1,1 }, dy[] = { 0,1,0,-1,-1,1,-1,1 }; templatevoid Sort(T& a) { sort(all(a)); } templatevoid RSort(T& a) { sort(rall(a)); } templatevoid Reverse(T& a) { reverse(all(a)); } templatevoid Unique(T& a) { a.erase(unique(all(a)), a.end()); } templateauto Max(const T& a) { return *max_element(all(a)); } templateauto Min(const T& a) { return *min_element(all(a)); } templateint MaxPos(const T& a) { return max_element(all(a)) - a.begin(); } templateint MinPos(const T& a) { return min_element(all(a)) - a.begin(); } templateint Count(const T& a, U v) { return count(all(a), v); } templateint Find(const T& a, U v) { auto pos = find(all(a), v); return pos == a.end() ? -1 : pos - a.begin(); } templateU Sum(const T& a, U v) { return accumulate(all(a), v); } templateint Lower(const T& a, U v) { return lower_bound(all(a), v) - a.begin(); } templateint Upper(const T& a, U v) { return upper_bound(all(a), v) - a.begin(); } templateint CountIf(const T& a, P f) { return count_if(all(a), f); } templatevoid RemoveIf(T& a, P f) { a.erase(remove_if(all(a), f), a.end()); } templateT Age(T n, T m) { return (n + m - 1) / m; } templateT Gcd(T n, T m) { return m == 0 ? n : Gcd(m, n % m); } templateT Lcm(T n, T m) { return n / Gcd(n, m) * m; } templateT Pow(T a, T n) { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; }return r; } templateT Powmod(T a, T n, T m = MOD) { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; } string operator*(string s, int n) { string ret; rep(i, n)ret += s; return ret; } /* INPUT */ templateT InputF() { T o; cin >> o; return o; } template<> char InputF() { char ret = '\0', c = getchar_unlocked(); while (c != '\0' && c != '\n' && c != '\t' && c != ' ') { ret = c; c = getchar_unlocked(); } return ret; } template<> string InputF() { string ret; char c = getchar_unlocked(); while (c != '\0' && c != '\n' && c != '\t' && c != ' ') { ret.push_back(c); c = getchar_unlocked(); } return ret; } template<> int InputF() { int ret = 0; bool neg = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while ('0' <= c && c <= '9') { ret = ret * 10 + (c - '0'); c = getchar_unlocked(); } return neg ? -ret : ret; } template<> LL InputF() { LL ret = 0; bool neg = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while ('0' <= c && c <= '9') { ret = ret * 10LL + (LL(c) - LL('0')); c = getchar_unlocked(); } return neg ? -ret : ret; } template<> double InputF() { double ret = 0, dp = 1; bool neg = false, adp = false; char c = getchar_unlocked(); if (c == '-') { neg = true; c = getchar_unlocked(); } while (('0' <= c && c <= '9') || c == '.') { if (c == '.') { adp = true; } else if (adp) { dp *= 0.1; ret += (c - '0') * dp; } else { ret = ret * 10.0 + (c - '0'); } c = getchar_unlocked(); } return neg ? -ret : ret; } string GetLine() { string ret; char c = getchar_unlocked(); while (c != '\0' && c != '\n') { ret.push_back(c); c = getchar_unlocked(); } return ret; } templateT StoT(string s) { return s; } template<> char StoT(string s) { return s.front(); } template<> string StoT(string s) { return s; } template<> int StoT(string s) { return stoi(s); } template<> LL StoT(string s) { return stoll(s); } template<> double StoT(string s) { return stod(s); } VS InputB; templatestruct InputC { operator T() { return InputF(); } vector operator[](int h) { vector ret(h); rep(i, h)ret[i] = InputF(); return ret; } vector> operator[](PII p) { int h, w; tie(h, w) = p; vector> ret(h, vector(w)); rep(i, h)rep(j, w)ret[i][j] = InputF(); return ret; } T at(int n) { while (sz(InputB) <= n)InputB.pb(InputF()); return StoT(InputB[n]); } vector at(int n, int h) { vector ret(h); rep(i, h)ret[i] = at(i + n); return ret; } vector> at(int n, int h, int w) { vector> ret(h, vector(w)); rep(i, h)rep(j, w)ret[i][j] = at(n + i * w + j); return ret; } }; InputC inc; InputC ins; InputC ini; InputC inl; InputC ind; /* OUTPUT */ class ostreamfbuff : public basic_streambuf> { protected:int overflow(int nCh = EOF) { putchar_unlocked(nCh); return 0; } }; class ostreamf : public basic_iostream> { public:ostreamf(void) : basic_iostream>(new ostreamfbuff()) {} }; ostreamf coutf; ostream& operator<<(ostream& ostr, InputC i) { ostr << string(i); return ostr; } struct BoolStr { string t, f; BoolStr(string _t, string _f) :t(_t), f(_f) {} }yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":("); struct Divizer { string s; Divizer(string _s) :s(_s) {} }spc(" "), nosp(""), comma(","), lin("\n"); struct Output { bool flag = false; BoolStr bs; Divizer di; Output(bool f, BoolStr b, Divizer d) :flag(f), bs(b), di(d) {} templatevoid print(T o) { coutf << o; } void print(double o) { printf("%.20f", o); } void print(bool o) { coutf << (o ? bs.t : bs.f); } templatevoid print(const pair& o) { print(o.first); coutf << di.s; print(o.second); } templatevoid print(const vector& o) { for (int i = 0; i < (int)o.size(); ++i) { if (i != 0)coutf << di.s; print(o[i]); } } templatevoid print(const vector>& o) { for (int i = 0; i < (int)o.size(); ++i) { if (i != 0)coutf << '\n'; print(o[i]); } } templatevoid print(const map& o) { coutf << "Map"; for (auto a : o) { coutf << " {"; print(a); coutf << "},"; } coutf << '\n'; } templatevoid print(const set& o) { coutf << "Set {"; for (auto a : o) { print(a); coutf << ","; } coutf << "}\n"; } templateOutput operator ,(T o) { if (flag)coutf << di.s; print(o); Output t(true, bs, di); return t; } Output operator,(Output o) { coutf << '\n'; return o; } Output operator,(BoolStr b) { Output t(flag, b, di); return t; } Output operator,(Divizer d) { Output t(flag, bs, d); return t; } }out(false, Yes, spc); /* ANSWER */ struct Answer { int mini = INT_MAX, maxi = INT_MIN, sumi = 0; LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0; double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0; int cnt = 0; void operator=(int n) { mini = min(mini, n); maxi = max(maxi, n); sumi += n; cnt++; } void operator=(LL n) { minl = min(minl, n); maxl = max(maxl, n); suml += n; cnt++; } void operator=(double n) { mind = min(mind, n); maxd = max(maxd, n); sumd += n; cnt++; } }ans; bool Check(int c1, int c10, int cost, int sumc, int c) { int m = c1 + c10 * 10; if (m < cost)return false; int change = m - cost; int ChengeNum = change / 10 + change % 10; return sumc - (c1 + c10) + ChengeNum == c; } int main() { int a = ini, b = ini, c = ini; FOR(cost, 1, a + b * 10 + 1) { rep(c1, a + 1)rep(c10, b + 1) { if (Check(c1, c10, cost, a + b, c)) { ans = cost; } } } if (ans.mini == INT_MAX)puts("Impossible"); else out, ans.mini, out; }