#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
typedef priority_queue<Pd,vector<Pd>,greater<Pd>> Pd_queue;

const ll MOD=998244353;
const ll mod=1000000007;
const ll INF=1e15;
const double DEL=1e-3;
vec dx={1,0,-1,0};
vec dy={0,1,0,-1};

#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(),a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
#define ADD(a,b) a=(a+b)%mod
#define CHECK cout<<"arrived"<<endl

vec A={1,0},B={0,1};
mat K={{1,1},{1,0}};
ll X,Y,Z,N;
P NG=mp(-1,-1);

P renritsu(ll x, ll y, ll n, ll m){
    if(n==0){
        ll a=x;
        ll K3=y-A[m]*a;
        if(K3<B[m]) return NG;
        if(K3%B[m]) return NG;
        return mp(a,K3/B[m]);
    }
    if(n==1){
        ll b=x;
        ll K3=y-B[m]*b;
        if(K3<A[m]) return NG;
        if(K3%A[m]) return NG;
        return mp(K3/A[m],b);
    }
    ll K=B[n]*A[m]-B[m]*A[n];
    ll K1=A[m]*x-A[n]*y;
    if(K1<0) {K1*=(-1); K*=(-1);}
    if(K<=0) return NG;
    if(K1<K) return NG;
    if(K1%K) return NG;
    ll b=K1/K;
    ll K2=x-B[n]*b;
    if(K2<0) return NG;
    if(K2%A[n]) return NG;
    ll a=K2/A[n];
    return mp(a,b);
}

vector<P> REN(ll x, ll y){
    if(x>y) return REN(y,x);
    vector<P> ret;
    if(x==y) return ret;
    rep(i,N-1) REP(j,i+1,N){
        P kari=renritsu(x,y,i,j);
        if(kari.first>0) ret.pb(kari);
    }
    sort(ALL(ret));
    return ret;
}

P Solve(){
    if(X==Z) {
        if(X==1) return mp(1,1);
        vector<P> d=REN(1,X);
        return d[0];
    }
    vector<P> d=REN(X,Z);
    rep(i,d.size()){
        rep(j,N){
            ll AA=d[i].first, BB=d[i].second;
            if(AA*A[j]+BB*B[j]==Y) return d[i];
            if(AA*A[j]+BB*B[j]>Y) break;
        }
    }
    return NG;
}
int main(){
    REP(i,2,120){
        A.pb(A[i-1]+A[i-2]);
        B.pb(B[i-1]+B[i-2]);
        if(A[i]+B[i]>1e9) break;
    }
    N=B.size();
    vec I(3);
    rep(i,3) cin>>I[i];
    sort(ALL(I));
    X=I[0]; Y=I[1]; Z=I[2];
    P ans=Solve();
    if(ans.first<0) cout<<-1<<endl;
    else cout<<ans.first<<' '<<ans.second<<endl;





}