#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  int a, b, w;
  cin >> a >> b >> w;
  
  w *= 1000;
  
  int min_orange = -1;
  int max_orange = -1;
  
  if (w % b == 0) min_orange = w / b;
  else if ((w / b + 1) * b - w <= (b - a) * (w / b + 1)) min_orange = w / b + 1;

  if (w % a == 0) max_orange = w / a;
  else if ((w / a) * a - w <= (b - a) * (w / a)) max_orange = w / a;
  
  //cout << min_orange << endl;
  
  if (min_orange == -1 || max_orange == -1) cout << "UNSATISFIABLE" << endl;
  else cout << min_orange << " " << max_orange << endl;

  return 0;
}
#include <bits/stdc++.h>
#define int long long
using namespace std;

int cx[1000005];
int ci[1000005];

signed main(){
int a,b,w;
memset(ci,0X3f,sizeof(ci));
memset(cx,0,sizeof(cx));
ci[0] = 0;
cin>>a>>b>>w;
w = w*1000;

int judge = 0;
for(int i=a;i<=b;i++)
    for(int j=i;j<=w;j++){
    cx[j] = max(cx[j],cx[j-i]+1);
    ci[j] = min(ci[j],ci[j-i]+1);

}
//4557430888798830399

if(ci[w]==4557430888798830399)
    cout<<"UNSATISFIABLE";
else
    cout<<ci[w]<<" "<<cx[w];





}