#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,j,n) for(int i=j;i<n;i++)
#define readvec(v,n) for(int i=0;i<n;i++){cin>>v[i];}
#define MOD 1000000007
int main()
{
  int a,b,w;cin>>a>>b>>w;w*=1000;
  if(w<a){cout<<"UNSATISFIABLE";return 0;}
  int t=w%a;
  if(w<a||(a+((double)(t))/(w/a)>(double)b)){cout<<"UNSATISFIABLE";return 0;}

  int x=min(w,b);
  if(w%x==0)cout<<w/x; else cout<<w/x+1; cout<<" ";
  if(w%a==0)cout<<w/a; else cout<<w/a; cout<<"\n";
  return 0;
}

//#include "bits/stdc++.h"

#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <array>
#include <unordered_map>
#include<unordered_set>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
#include<iomanip>
#include<complex>
#include<fstream>
#include<assert.h>

#include<stdio.h>

using namespace std;

#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)

#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, double> pid;
typedef pair<double, int> pdi;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;

template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;

const double EPS = 1e-16;

signed main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int A, B, W;
	cin >> A >> B >> W;

	W *= 1000;
	int mi = INF, ma = 0;

	rep(i, 1, W + 1)
	{
		if (A*i <= W && W <= B * i)
		{
			chmin(mi, i);
			chmax(ma, i);
		}
	}

	if (mi == INF)cout << "UNSATISFIABLE" << endl;
	else
	cout << mi << " " << ma << endl;

	return 0;
}