#include "iostream"

using namespace std;

int main() {
    int a, b, w;
    cin >> a >> b >> w;
    w *= 1000;
    const int INF = 1001001001;
    int l = INF, r = -INF;
    for (int n = 1; n <= w; ++n) {
        if (a*n <= w && w <= b*n) {
            l = min(l, n);
            r = max(r, n);
        }
    }
    if (l == INF) {
        cout << "UNSATISFIABLE" << endl;
    } else {
        cout << l << " " << r << endl;
    }
    return 0;
}
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define rreps(i, n, s) for (int i = s; i >= n; i--)

using ll = long long;
using namespace std;
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int MOD = 1000000007;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    double sx, sy, gx, gy;
    cin >> sx >> sy >> gx >> gy;
    double cx = gx - sx;
    double cy = gy / sy;
    double dx = cx * (1 / (1 + cy));
    cout << fixed << std::setprecision(10) << sx + dx << endl;
    return 0;
}