#include <iostream>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define fast_io                                                                                                                \
    ios::sync_with_stdio(false);                                                                                               \
    cin.tie(0)
using ll = long long;

#define rep(i,a,n) for(ll i=a;i<=n;i++)
#define per(i,a,n) for(ll i=n;i>=a;i--)
#define pb push_back
#define mod 998244353
#define inf 0x3f3f3f3f
using namespace std;

//struct cmp {
//	bool operator()(pair<ll, ll>& p1, pair<ll, ll>& p2) {
//	}
//};
void solve() {
	double a, b, w;
	cin >> a >>b>> w;
	w *= 1000;
	double cmp = w / b;
	int min, max;
	if (cmp != (int)cmp) cmp++;
	min = (int)cmp;
	max = w / a;
	if (max < min) cout << "UNSATISFIABLE" << endl;
	else  cout << min << " " << max << endl;
	
	
	

	//string ans= "No";
	//if (h % m == 0) ans = "Yes";
	//cout << ans << endl;
}

int main(void)
{
	//int t; cin >> t; for (int i = 0; i < t; i++) {solve();}
	solve();
	return 0;
}
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<queue>
#include<list>
#include<stack>
#include<bitset>
#include<iomanip> 
#include<set>
#include<cmath>
#include<map>
#include<functional>
#define int long long
#define IO ios::sync_with_stdio(false)
using namespace std;
int a,b,c;
const int mod=998244353;
signed main()
{
	IO;
	cin>>a>>b>>c;
	int a1,a2,a3;
	a1=(a*(a+1)/2)%mod;
	a2=(b*(b+1)/2)%mod;
	a3=(c*(c+1)/2)%mod;
	cout<<((((a1*a2)%mod)*a3)%mod);
 } 