#include<iostream>
#include<cmath>
using namespace std;
int main() {
	int a,b,c,i,j,k;
	scanf("%d %d %d",&a,&b,&c);
	c=c*1000;
	i=b-a;
	if(c%b==0)
		printf("%d ",c/b);
	else {
		k=c/b+1;
		j=b*k-c;
		if((double)j/i>k) {
			printf("UNSATISFIABLE");
			return 0;
		} else
			printf("%d ",k);
	}
	if(c%a==0)
		printf("%d",c/a);
	else {
		k=c/a;
		j=c-a*k;
		if((double)j/i>k)
			printf("UNSATISFIABLE");
		else
			printf("%d",k);
	}

	return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<d<<endl;
#define vecp(p) int aa;cin>>aa;(p).push_back(aa);
#define vecpl(p) long long aa;cin>>aa;(p).push_back(aa);
#define vecps(p) string aa;cin>>aa;(p).push_back(aa);
#define vecp2(p) cin>>aa;(p).push_back(aa);
#define vecpl2(p) long long a	b;cin>>ab;(p).push_back(ab);
#define vecps2(p) string ab;cin>>ab;(p).push_back(ab);
#define sorts(c) sort((c).begin(),(c).end());
#define reverses(c) reverse((c).begin(),(c).end());
#define vec(b) vector<int> (b);
#define vecl(b) vector<long long> (b);
#define vecs(b) vector<string> (b);
#define pb(b,a) (b).push_back((a));
#define doublece(a,b) cout<<(a)<<' '<<(b)<<endl;
#define pairs(s) vector<pair<int,int>> (s);
#define pairsp(s) int aa,bb;cin>>aa>>bb;(s).push_back(make_pair(aa,bb));
#define MOD 1000000007
#define cey ce("Yes")
#define cen ce("No")
#define ceY ce("YES")
#define ceN ce("NO")

int main()
{
	int A, B, W;
	cin >> A >> B >> W;
	W *= 1000;
	int mini = INT_MAX, maxi = 0;
	if (W%A==0) {
		maxi = W / A;
	}
	if (W%B==0) {
		mini = W / B;
	}
	if (maxi>0&&mini>0) {
		doublece(mini,maxi)
	}
	else {
		if (W/A==W/B) {
			ce("UNSATISFIABLE")
		}
		else {
			doublece(W / B+1, W / A)
		}
	}
	return 0;
}