#include<bits/stdc++.h>
#include <stdlib.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define f0(i,n) for(int i=0;i<=n;i++)
#define first_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define in_buffer cin.ignore(numeric_limits<streamsize>::max(), '\n')
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define zero (int)0
#define int long long
#define double long double
#define pb push_back
#define pii make_pair
#define goto_hell return 0
#define newline cout  << "\n"
#define endl "\n" // << flush
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
using namespace __gnu_pbds;
using namespace std;
const int mod = 1e9+7;
const int inf = LONG_MAX;


void solve(int test)
{
    int c,e,m;
    cin >> c >> e >> m;
    if(c!=4)
    {
        cout << "impossible\n";
        return;
    }
    if(c==4 and e==0 and m==0)
    {
        cout << 2 << " " << 2 << endl;
        return;
    }
    if(m==0)
    {
        if(e%2==0)
        {
            cout << (e/2)+2 << " " << 2 << endl;
        }
        else
        {
            cout << "impossible\n";
        }
         return;
    }
    int mm =sqrt(m)+1;
    for(int i=1;i<=mm;i++)
    {
        if(m%i==0)
        {
            int x=i;int y=m/i;
            if(2*x+2*y==e)
            {
                cout << max(x,y)+2 << " " << min(x,y)+2 << endl;
                return;
            }
        }
    }

        cout << "impossible\n";
}



int32_t main()
{
    first_IO;
    int test=1;
    //cin >> test;
    //cout << "Test = " << test << endl;
    //in_buffer;
    for(int t=1;t<=test;t++)solve(t);
    goto_hell;
}