#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define FordE(i, l, r) for (int i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <pii> vpii;
typedef vector <vi> vvi;

const int N = 1e3 + 5, inf = 1e9 + 7;

int dp1[N], dp2[N];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen(".inp", "r", stdin);
    // freopen(".out", "w", stdout);
    int a, b, w; cin >> a >> b >> w; w *= 1000;
    int ansa = (w + b - 1) / b, ansb = w / a;
    if (ansa > ansb){
        cout << "UNSATISFIABLE" << endl;
    }
    else{
        cout << ansa << ' ' << ansb << endl;
    }
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/
#include <bits/stdc++.h>
using namespace std;

int main(){
  int a,b,w,x,y;
  cin >> a >> b >> w;
  w *= 1000;
  if((w + b -1) / b * a <= w){
    cout <<  (w + b - 1) / b << endl;;
  }
  if((w / a) * b >= w){
    cout << w / a << endl;
  }
  else{
    cout << "UNSATISFIABLE" << endl;
  } 
}