#include <iostream>
#include <cmath>

using namespace std;

int main(){
    int a,b,wk;
    cin >> a >> b >> wk;
    int w = wk * 1000;
    int dif = b - a;
    int min = 0;
    if(w%b==0){
        min = w/b;
    }else{
        min = w/b + 1;
    }
    int mmin = b * min - w;
    if(mmin > min * dif){
        min += 1;
    }
    int max = w/a;
    int mmax = w - a*min;
    if(mmax > dif * max){
        max -= 1;
    }

    if(min > max){
        cout << "UNSATISFIABLE" << endl;
    }else{
        cout << min << " " << max << endl;
    }
}
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)

vector <int> dy = {0, 1, 0, -1};
vector <int> dx = {1, 0, -1, 0};

const int INF = 1000000000;
const ll INFLL = 100000000000000000;

long long pow(long long x, long long n) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret *= x;  // n の最下位bitが 1 ならば x^(2^i) をかける
        x *= x;
        n >>= 1;  // n を1bit 左にずらす
    }
    return ret;
}

int main(){
    int x, y, z; cin >> x >> y >> z;
    for(int ans = 1; ans <= 10000000; ans ++){
        if(x * ans < z * y){
            continue;
        }
        cout << ans - 1 << endl;
        return 0;
    }
}