#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi& a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 55, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

int x, y, z;

ll a[MX], b[MX];

int main(){
  cin >> x >> y >> z;
  a[0] = 1; b[1] = 1;
  int n = 0;
  for (int i = 2;; ++i) {
    a[i] = a[i-1]+a[i-2];
    b[i] = b[i-1]+b[i-2];
    if (a[i]+b[i] > INF) {
      n = i;
      break;
    }
  }
  if (x == y && y == z) {
    ll ans = x;
    rrep(i,n) {
      if (x <= a[i]) break;
      if ((x-a[i])%b[i] == 0) mins(ans,(x-a[i])/b[i]);
    }
    printf("1 %lld\n",ans);
    return 0;
  }
  if (x == y) swap(y,z);
  P ans(INF,INF);
  rep(i,n)rep(j,n)rep(k,n){
    if (i == j) continue;
    ll d = b[i]*a[j]-b[j]*a[i];
    ll e = a[j]*x-a[i]*y;
    if (d < 0) d = -d, e = -e;
    if (e <= 0 || e%d != 0) continue;
    ll bx = e/d;
    ll ax = 0;
    if (a[i] != 0) {
      ax = x-b[i]*bx;
      if (ax <= 0 || ax%a[i] != 0) continue;
      ax /= a[i];
    } else {
      ax = y-b[j]*bx;
      if (ax <= 0 || ax%a[j] != 0) continue;
      ax /= a[j];
    }
    if (a[k]*ax+b[k]*bx == z) {
      mins(ans,P((int)ax,(int)bx));
    }
  }
  if (ans.fi == INF) cout << -1 << endl;
  else cout << ans.fi << " " << ans.se << endl;
  return 0;
}