#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

bool solve2x2(int A[2][2], int b[2], ll &x, ll &y) {
	ll det = (ll)A[0][0] * A[1][1] - (ll)A[0][1] * A[1][0];
	if(det == 0)
		return false;
	ll xnum = (ll)b[0] * A[1][1] - (ll)b[1] * A[0][1];
	ll ynum = (ll)b[1] * A[0][0] - (ll)b[0] * A[1][0];
	if(xnum % det != 0 || ynum % det != 0)
		return false;
	x = xnum / det;
	y = ynum / det;
	assert((ll)A[0][0] * x + A[0][1] * y == b[0]);
	assert((ll)A[1][0] * x + A[1][1] * y == b[1]);
	return true;
}

int main() {
	const int MaxX = (int)1e9;
	int X[3];
	while(~scanf("%d%d%d", &X[0], &X[1], &X[2])) {
		vi fibA = {1, 0}, fibB = {0, 1};
		while(fibA.back() <= MaxX)
			fibA.push_back(fibA.end()[-1] + fibA.end()[-2]);
		while(fibB.back() <= MaxX)
			fibB.push_back(fibB.end()[-1] + fibB.end()[-2]);
		int n = (int)min(fibA.size(), fibB.size());
		sort(X, X + 3);
		if(X[0] == X[2])
			X[0] = 1;
		pair<ll, ll> ans(INFL,INFL);
		vector<ll> v;
		rep(i, n) rep(j, n) if(i != j) {
			int mat[2][2] = {{fibA[i], fibB[i]}, {fibA[j], fibB[j]}};
			int vec[2] = {X[0], X[2]};
			ll A, B;
			bool ok = solve2x2(mat, vec, A, B);
			ok &= A > 0 && B > 0;
			if(!ok) continue;
			v = { A, B };
			while(v.back() <= MaxX)
				v.push_back(v.end()[-1] + v.end()[-2]);
			if(find(all(v), X[1]) != v.end())
				amin(ans, mp(A, B));
		}
		if(ans.first == INFL)
			puts("-1");
		else
			printf("%lld %lld\n", ans.first, ans.second);
	}
	return 0;
}