#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main()
{  cin.tie(NULL);
   ios_base::sync_with_stdio(false);
   cout.tie(NULL);
   int a,b,w;
   cin>>a>>b>>w;
   w=w*1000;
   int l=INT_MAX;//min
   int r=INT_MIN;//max;
   for(int i=1;i<=w;i++)
   {
     if(a*i<=w&&w<=b*i)
     {
         l=min(i,l);
         r=max(i,r);
     }
   }
   if(l!=INT_MAX&&r!=INT_MIN)
   {
   cout<<l<<" "<<r<<endl;
   }
   else
   {
       cout<<"UNSATISFIABLE"<<endl;
   }
   return 0;
}


#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define coutArray(a,n) for(int i = 0; i < n; i++){cout << a[i] << " ";};cout << endl;
#define ld long double
#define PI 3.141592653589793238
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
#define int ll

void solve(){
    int a, b, w; cin >> a >> b >> w;
    int mx = w / (a / 1000.0);
    int mn = ceil(w / (b / 1000.0));
    if(mn > mx){
        cout << "UNSATISFIABLE" << endl;
        return;
    }
    cout << mn << " " << mx << endl;
}

int32_t main(){
    FAST
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}
