#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
    int a,b,w;
    cin>>a>>b>>w;
    w*=1000;
    int x=w/a,y=w/b;
    //if (w%a==0 && w%b!=0) cout<<w/a<<" "<<w/a<<endl;
    //else if (w%b==0 && w%a!=0) cout<<w/b<<" "<<w/b<<endl;
    if (x==y && w%a!=0 && w%b!=0) cout<<"UNSATISFIABLE"<<endl;

    else cout<<setprecision(8)<<ceil(double(double(w)/double(b)))<<" "<<floor(double(double(w)/double(a)))<<endl;
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#include <functional>
#include <chrono>

#define int long long
#define ld long double
#define db double
#define endl "\n"
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()

using namespace __gnu_pbds; 
using namespace std;
using namespace chrono;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void deb_out() { 
    cout << endl; 
}
template <typename Head, typename... Tail>
void deb_out(Head H, Tail... T) {
    cout << " " << H;
    deb_out(T...);
}
#ifdef LOCAL
    #define deb(...) cout << "[" << #__VA_ARGS__ << "]:", deb_out(__VA_ARGS__);
#else
    #define deb(...) ;
#endif

const long double PI = 3.14159265358979323846264338;
const long long INF = 1000000000000000000;
const long long INF1 = 1000000000;
const long long MOD = 1000000007;
// const long long MOD = 998244353;

inline int cl(int a, int b){
    if(a % b)
        return 1 + a / b;
    return a / b;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int Tests = 1;
    // cin >> Tests;
    while (Tests--) {
        int a, b, w;
        cin >> a >> b >> w;
        w *= 1000;
        // int g = __gcd(a, b);    
        // deb(g, a, b, w % g)    
        // if (w < a || w % g) {
        //     cout << "UNSATISFIABLE" << endl;
        //     continue;
        // }
        // int mn = cl(w, b);
        // int mx = w / a;
        // cout << mx << " " << mn << endl;
        int mx = 0, mn = INF;
        for (int i = 0 ; a * i <= w ; i++) {
            int dn = i * a;
            int df = w - dn;
            int ex = b - a;
            if (df <= i * ex) {
                mx = max(mx, i);
                // deb(i, df)
                // mn = min(mn, i);
            }
        }
        for (int i = 0 ; b * i <= w + 5 * b ; i++) {
            // deb(i)
            int dn = i * b;
            int df = -w + dn;
            // deb(df)
            int ex = b - a;
            if (df <= ex * i && df >= 0) {
                mn = min(mn, i);
                // mn = min(mn, i);
            }
        }
        if (mx == 0) {
            cout << "UNSATISFIABLE" << endl;
            continue;
        } else {
            cout << mn << " " << mx << endl;
        }
    }   
}
