#include<bits/stdc++.h> 
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};
long double eps = 1e-9;
long double pi = acos(-1);
#define totori signed
#define nyaa main



totori nyaa(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(20);

	int a,b,w;
	cin>>a>>b>>w;
	w *= 1000;
	if(w < a){
		cout << "UNSATISFIABLE" << endl;
		return 0;
	}
	int mi = w / b;
	int rem = w % b + mi*(b-a);
	if(rem >= a || w%b==0){
		mi += (w%b!=0);
	}
	else {
		cout << "UNSATISFIABLE" << endl;
		return 0;
	}
	int ma = w / a;
	rem = w % a;
	if(w % a == 0)cout << mi << " "<<ma << endl;
	else if((b-a)*ma >= rem)cout <<mi<<" "<< ma << endl;
	else if((b-a)*(ma+1)>=rem)cout << mi << " " << ma+1 << endl;
	else cout << "UNSATISFIABLE" << endl;

}
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int A,B,W;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>A>>B>>W;
	W*=1000;
	int mi=100000000,ma=-1;
	for(i=1;i<=1000000;i++) {
		if(A*i<=W&&W<=B*i) mi=min(mi,i), ma=max(ma,i);
		
	}
	if(mi<=ma) cout<<mi<<" "<<ma<<endl;
	else cout<<"UNSATISFIABLE"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}
