#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define p_q priority_queue
#define m_p make_pair
#define pb push_back
#define ld long double
#define F first
#define S second
#define ull unsigned long long
#define mod 1000000007
#define md 998244353
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
using namespace std;
inline void read(int &x)
{
	short negative=1;
    x=0;
    char c=getchar();
    while(c<'0' || c>'9')
    {
		if(c=='-')
			negative=-1;
		c=getchar();
	}
    while(c>='0' && c<='9')
        x=(x<<3)+(x<<1)+(c^48),c=getchar();
    x*=negative;
}
ll qpow(ll n,ll k){
	ll ans=1;
	while(k){
		if(k%2){
			ans*=n;
			ans%=mod;
		}
		n*=n;
		n%=mod;
		k/=2;
	}
	return ans;
}
string iots(int n)
{
	string s="";
	while(n)
	{
		int now=n%10;
		s+=now+'0';
		n/=10;
	}
	reverse(s.begin(),s.end());
	return s;
}
int stoi(string s)
{
	int n=0;
	rep(i,s.size())
	{
		n*=10;
		n+=s[i]-'0';
	}
	return n;
}
int a,b,w;
int main()
{
	ios::sync_with_stdio(0);
	cin>>a>>b>>w;
	w*=1000;
	bool f=0;
	forn(i,1,w) 
	{
		if((ld)w/(ld)i<=(ld)b&&(ld)w/(ld)i>=(ld)a)
		{
			f=1;
		}
	}
	if(!f)
	{
		cout<<"UNSATISFIABLE\n";
		return 0;
	}
	cout<<(w+b-1)/b<<" "<<w/a<<endl;
	return 0;
}
//特判判全
//循环边界
//精度足够
//注意初值

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

void solution()
{
  double s, e, w;
  cin >> s >> e >> w;
  w *= 1000;
  int end = floor(w / (double)s);
  int start = ceil(w / (double)e);
  int first = -1, last = -1;
  bool flag = true;
  for(int i = start; i <= end; i++)
  {
    if(w / w * w == w)
    {
      if(flag)
      {
        first = i;
        flag = false;
      }
      last = i;
    }
  }
  if(first < 0)
  {cout << "UNSATISFIABLE" << endl;}
  else
  {cout << first << " " << last << endl;}
  return;
}

int main()
{
  int count, counter = 0;
  count = 1;
  while(counter++ < count)
  {solution();}
  return 0;
}
