#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main () 
{
  int A, B, W;
  cin >> A >> B >> W;
  W *= 1000;
  
  int m = (W + B-1) / B;
  int M = W / A;
  if (m > M)
    cout << "UNSATISFIABLE" << endl;
  else 
    cout << m << " " << M << endl;
    
  return 0;
}
#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define loop(i, n) for(int i = 1; i <= n; i++)
typedef long long ll;
typedef double lf;
int main(){
    fast;
    int a,b,w;
    cin >> a >> b >> w;
    int m=1e9,M=0;
    loop(i, 1000000){
        if(a*i<=1000*w && 1000*w<=b*i){
            m=min(m,i);
            M=max(M,i);
        }
    }
    if(!M) cout << "UNSATISFIABLE";
    else cout << m << ' ' << M;
}