#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;

int solve(int nkr, int b, int a, int i) {
    if (nkr == 0) return 0;

    int cur = 1;
    while (true) {
        int we = nkr / cur;
        if (we < a) return -1;
        else if (we < b) return cur;

        cur++;
    }
}

int main() {
    int a, b, w;
    cin >> a >> b >> w;
    int w1000 = w * 1000;

    int INF =1001001001;
    int mi=INF;
    int bmax = w1000 / b;
    for (int i = bmax; i >= 0; --i) {
        int sol = solve(w1000 - i * b, b, a, i);
        if (sol != -1) { mi = i + sol; break; }
    }

    int ma;
    int amax = w1000 / a;
    for (int i = amax; i >= 0; --i) {
        int sol = solve(w1000 - i * a, b, a, i);
        if (sol != -1) { ma = i + sol; break; }
    }

    // if (w1000/a == w1000/b) cout << "UNSATISFIABLE" << endl;
    if (mi==INF) cout << "UNSATISFIABLE" << endl;
    else cout << mi << " " << ma << endl;
}
typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;

int main() {
    ld a,b,c,d;
    std::cin >> a>>b>>c>>d;
    
    d *= -1;
    
    std::cout <<setprecision(20)<< -b*(c-a)/(d-b)+a << std::endl;
}
