#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;

int main() {
  int A, B, W; cin >> A >> B >> W;
  long double w = W * 1000;
  int vmin = ceil(w/B);
  int vmax = floor(w/A);
  if (vmax >= vmin) cout << vmin << " " << vmax << endl;
  else              cout << "UNSATISFIABLE" << endl;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long i = 0; i < n; i++)
int main() {
  int A, B, M;
  cin >> A >> B >> M;
  M *= 1000;
  int Q = M / A;
  int W = M / B;
  if(M % B != 0) W++;
  int U = 0, O = 0;
  for(int i = W; i <= Q; i++) {
    double T = i / 1.0;
    double R = M / T;
    if(U == 0) if(A <= R && R <= B) U = i;
    if(U != 0) if(A <= R && R <= B) O = i;
  }
  if(U == 0 && O == 0) cout << "UNSATISFIABLE" << endl;
  else cout << U << " " << O << endl;
}