#include<bits/stdc++.h>
#define eps 1e-9
#define MOD1 998244353
#define MOD2 1000000007
#define INV_2 499122177
#define INF 1000000000
#define PI 3.14159265358979323846

using namespace std;
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int a, b, w;
	cin >> a >> b >> w;
	w*=1000;
	if(w < a || ((b-a)*(w/a)) < (w%a))
		cout << "UNSATISFIABLE\n";
	else
	{
		int x=0;
		if(w%b)
			x++;
		cout << w/b + x << ' '; 
		cout << w/a << '\n';
	}
}	
//size
// 2021-03-14 18:10:57
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
template<class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } else return false; }
template<class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;

// clang-format on
const ll inf = 1e18;
void answer() {
  ll a, b, w;
  cin >> a >> b >> w;
  w *= 1000;
  ll l = inf, r = -inf;
  REPC(i, 1, 1000000) {
    if (a * i <= w && w <= b * i) {
      chmin(l, ll(i));
      chmax(r, ll(i));
    }
  }
  if (l == inf) {
    cout << "UNSATISFIABLE" << '\n';
  } else {
    cout << l << ' ' << r << '\n';
  }
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  answer();
  return 0;
}