#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 5e5 + 5, M = 1e6 + 5;
const ld PI = acos(-1.0), EPS = 1e-9;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll n, m, a[N];
vector<string> v[N];
string s;

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    int a, b, c;
    cin >> a >> b >> c;
    if (a != 4 || b % 2 == 1) return !(cout << "impossible");
    if (c == 0) return !(cout << b / 2 + 2 << " " << 2);
    for (int i = 1; i * i <= c; i++) {
        if (c % i == 0) {
            int num1 = i, num2 = c / i;
            if (num1 < num2) swap(num1, num2);
            if ((num1 + num2) * 2 == b) return !(cout << num1 + 2 << " " << num2 + 2);
        }
    }
    cout << "impossible";
    return 0;
}