#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353
#define PI 3.141592653
#define INF 100000000000000 //14
//cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
int main(){
    ll a, b, w; cin >> a >> b >> w; w*=1000;
    ll ma = -1; ll mi = INF;
    FOR(i,1,1000100) {
        if (a*i<=w && b*i>=w) {
            ma = max(ma,i); mi = min(mi,i);
        }
    }
    if (ma==-1 || mi==INF) cout << "UNSATISFIABLE" << endl;
    else cout << mi << " " << ma << endl;
}
#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int a, b, w;
	cin >> a >> b >> w;
	w *= 1000;
	int ca = w / a, cb = (w + b - 1) / b;
	if (cb <= ca) {
		cout << cb << " " << ca << endl;
	} else {
		cout << "UNSATISFIABLE" << endl;
	}
	return 0;
}
