#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <float.h>
#include <random>

#define repeat(i,n) for (int i = 0; (i) < (n); ++ (i))
#define debug(x) cerr << #x << ": " << x << '\n'
#define debugArray(x,n) for(long long hoge = 0; (hoge) < (n); ++ (hoge)) cerr << #x << "[" << hoge << "]: " << x[hoge] << '\n'
#define debugArrayP(x,n) for(long long hoge = 0; (hoge) < (n); ++ (hoge)) cerr << #x << "[" << hoge << "]: " << x[hoge].first<< " " << x[hoge].second << '\n'

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef vector<int> vint;
typedef vector<ll> vll;
const long long INF = INT_MAX;
const ll MOD = 1e9+7;

ll F[2][50];
void init(){
  repeat(i,2){
    F[i][0]=!i;
    F[i][1]=i;
    for(int j=2;j<=50;j++){
      F[i][j] = F[i][j-1]+F[i][j-2];
    }
  }
}

int main(){
  init();
  ll X,Y,Z;cin>>X>>Y>>Z;
  ll A=INF,B=INF;
  if(X==Y)swap(Y,Z);
  if(X==Y)X=1;
  for(int p=0;F[0][p]<=X;p++){
    for(int q=0;F[0][q]<=Y;q++){
      ll d=F[0][p]*F[1][q]-F[0][q]*F[1][p];
      ll a=F[1][q]*X-F[1][p]*Y;
      ll b=F[0][p]*Y-F[0][q]*X;
      if(!d||a/d<=0||b/d<=0)continue;
      d = abs(d);
      a = abs(a);
      b = abs(b);
      if(a%d==0&&b%d==0&&(A>(a/d)||((A==a/d)&&(B>b/d)))){
        for(int r=0;F[0][r]<=Z;r++){
          if(a/d*F[0][r]+b/d*F[1][r]==Z){
            A=a/d;
            B=b/d;
          }
        }
      }
    }
  }
  if(A==INF){
    cout<<-1<<endl;
  }else{
    cout << A <<" "<< B <<endl;
  }
  return 0;
}