#include <bits/stdc++.h>
using namespace std;
int main(){
  //freopen("vs.inp","r",stdin);
  int a,b,T;
  scanf("%d %d %d",&a,&b,&T);
  T*=1000;
  int s1=(T)/a;
  int s2=(T+b-1)/b;
  if((a+(T%a+s1-1)/s1)>b || (b-(T%b+s2-1)/s2)<a) printf("UNSATISFIABLE"); 
  else printf("%d %d",s2,s1);
}
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

int main2() {
  ll A = nextLong();
  ll B = nextLong();
  ll W = 1000 * nextLong();

  int mi = 90000000;
  int ma = -1;
  for (int k = 1; k <= 10000000; k++) {
    if (k * A <= W && W <= k * B) {
      chmin(mi, k);
      chmax(ma, k);
    }
  }
  if (ma == -1) {
    cout << "UNSATISFIABLE" << endl;
  } else {
    cout << mi << " " << ma << endl;
  }
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}