#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
#define ll long long
#define ld long double

using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
 
long long powm(long long a, long long b,long long mod) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a %mod;
        a = a * a %mod;
        b >>= 1;
    }
    return res;
}
 
 
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);      
}


signed main()
{
 
ios_base::sync_with_stdio(false); 
cin.tie(NULL);  
cout.tie(0);   
 
#ifndef ONLINE_JUDGE
    if(fopen("INPUT.txt","r"))
    {
        freopen("INPUT.txt","r",stdin);
        freopen("OUTPUT.txt","w",stdout);
    }
#endif          

    int v,s,d,t;
    cin>>v>>t>>s>>d;
    int x=t*v;
    int y=v*s;
    if(x<=d && y>=d)
    {
        cout<<"No";
    }
    else
        cout<<"Yes";

}  
#include <algorithm>
#include <iostream>
#include <queue>
#include <bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()

using ll = long long;
const int MOD = 1e9 + 7;

void solve() {
    int a, b, w;
    cin >> a >> b >> w;
    w *= 1000;
    int x = 1e9, y = -1;
    for(int i = 1; i <= w; i++) {
        if(a * i <= w && w <= b * i) {
            x = min(x, i);
            y = max(y, i);
        }
    }
    if(y == -1) {
        cout << "UNSATISFIABLE";
    } else {
        cout << x << ' ' << y;
    }
}

int main() {
    cin.sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}
