#include <bits/stdc++.h>

#define _GLIBCXX_DEBUG

using namespace std;

using ll = long long;
using ld = long double;
const int INF = (INT_MAX >> 1);
const ll LLINF = (LLONG_MAX >> 1);
#define all(x) x.begin(), x.end()

#define rep(i, s, e) for(ll i = s; i < e; ++i)
#define repr(i, s, e) for(ll i = s; i > e; --i)

template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll a, b, w; cin >> a >> b >> w;
    w *= 1000;
    ll cnt_min = LLINF, cnt_max = -LLINF;

    rep(cnt, 1, a * w + 1){
        if (a * cnt <= w && w <= b * cnt){
            chmax(cnt_max, cnt);
            chmin(cnt_min, cnt);
        }
    }

    if (cnt_max == -LLINF && cnt_min == LLINF) cout << "UNSATISFIABLE" << endl;
    else cout << cnt_min << " " << cnt_max << endl;

    return 0;
}

#include<bits/stdc++.h>

using namespace std;

/**templates**/
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;

#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sull(x) scanf("%llu",&x)
#define sf(x) scanf("%lf",&x)
#define ss(x) scanf(" %s",x)
#define sc(x) scanf(" %c",&x)
#define pi acos(-1.0)
#define pb push_back
#define aa first
#define bb second
#define sz(x) (ll)(x).size()
#define cas printf("Case %lld: ",++t)
#define casline printf("Case %lld:\n",++t)
//#define cas cout<<"Case "<<++t<<": "
//#define casline cout<<"Case "<<++t<<":"<<endl;
#define distance(x1,y1,x2,y2)((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
#define endl "\n"
#define bug cout<<"bugggggggggggg "<<endl;
#define fast ios_base::sync_with_stdio(0);cin.tie(nullptr); ///no printf/scanf
#define clean fflush(stdout)

const ll mod = 1000000007;
const ll inf = 1LL<<62;
const ll mx = 100005;
const double eps = 1e-10;

ll dx[10]={1,0,-1,0};
ll dy[10]={0,-1,0,1};
///ll dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; /// 8 Direction
///ll dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; /// Knight Direction

ll power(ll a,ll b)
{
    if(b==0)return 1;
    ll x=power(a,b/2);
    x=x*x;
    if(b%2)x=x*a;
    return x;
}

ll bigmod(ll a,ll b)
{
    if(b==0)return 1;
    ll x=bigmod(a,b/2)%mod;
    x=(x*x)%mod;
    if(b%2)x=(x*a)%mod;
    return x;
}

ll Set(ll N,ll pos){return N=N | (1LL<<pos);}
ll reset(ll N,ll pos){return N= N & ~(1LL<<pos);}
bool check(ll N,ll pos){return (bool)(N & (1LL<<pos));}

/**
        ...ENDING OF TEMPLATE...
*/


int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    fast; ///no printf/scanf
    /** Use "long double"(%Lf) instead of double for precision safety*/
    ll tst,a,b,c,k,n,d,m,res=0,ans=0,t=0;
    sl(a),sl(b),sl(n);
    res=-1,ans=-1;
    n*=1000;
    ll ok=0;
    for(ll k=a;k<=b;k++){
            if(ok)
                break;
            c=n/k;
            for(ll i=c;i>=0;i--)
            {
                m=n-i*k;
                vl v;
                for(ll j=1;j*j<=m;j++)
                {
                    if(m%j==0)
                    {
                        v.pb(j);
                        if(j==m/j)
                            continue;
                        v.pb(m/j);
                    }
                }
                d=inf;
                for(auto j:v)
                {
                    if(j>=a and j<=b)
                    {
                        d=min(d,j);
                    }
                }
                if(d!=inf)
                {
                    ok=1;
                    res=i+(m/d);
                    break;
                }
            }
    }

    if(res==-1)
    {
        cout<<"UNSATISFIABLE"<<endl;
        return 0;
    }

    ok=0;
    for(ll k=b;k>=a;k--){
            if(ok)
                break;
            c=n/k;
            for(ll i=c;i>=0;i--)
            {
                m=n-i*k;
                vl v;
                for(ll j=1;j*j<=m;j++)
                {
                    if(m%j==0)
                    {
                        v.pb(j);
                        if(j==m/j)
                            continue;
                        v.pb(m/j);
                    }
                }
                d=-inf;
                for(auto j:v)
                {
                    if(j>=a and j<=b)
                    {
                        d=max(d,j);
                    }
                }
                if(d!=-inf)
                {
                    ok=1;
                    ans=i+(m/d);
                    break;
                }
            }

    }

//    else
//    {
        swap(res,ans);
        cout<<res<<" "<<ans<<endl;
//    }





    return 0;
}
