#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 <iostream>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include <queue>
#include <sstream>
#include <ctime>
#include <iterator>
#include <string.h>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <fstream>
#include <assert.h>

using namespace std;

void solve()
{
	int a, b, w;
	cin >> a >> b >> w;
	w *= 1000;

	int c = w / b;
	int d = w / a;
	int e = w - d * a;
	if (e > (b - a) * d)
		cout << "UNSATISFIABLE";
	else
		cout << c + (c * b != w) << " " << d;
}


int main()
{
	ios_base::sync_with_stdio(0);
	int t = 1;
	//cin >> t;
	while (t--)
	{
		solve();
	}
}