#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

long long a, b, w;

int main()
{
	scanf("%lld%lld%lld", &a, &b, &w);
	w *= 1000;
	long long cc = w / a;
	long long dd = w % a;
	if (dd > (b - a) * cc)
	{
		printf("UNSATISFIABLE");
		return 0;
	}
	long long ans2 = 0;
	cc = w / b;
	dd = w % b;
	if (!dd)
	{
		ans2 = cc;
	}
	else
	{
		ans2 = cc + 1;
	}
	printf("%lld %lld", ans2, w / a);
	return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<vector>

using namespace std;

#define fori(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define mem(a,b) memset((a),(b),sizeof(a));
#define all(x) (x).begin(),(x).end()

template<class T, class T2>bool ckmax(T& a, T2 b) { return a < b ? a = b, 1 : 0; }
template<class T, class T2>bool ckmin(T& a, T2 b) { return a > b ? a = b, 1 : 0; }

typedef long long ll;

const int maxn = 2e6 + 5;
int arr[maxn], ans[maxn];

int main(void)
{
	string cant = "UNSATISFIABLE";
	int a, b, c;
	int aa, bb;
	cin >> a >> b >> c;
	c *= 1000;
	aa = c / a;
	bb = (c+b-1) / b;
	if (aa < bb) cout << cant;
	else cout << bb << ' ' << aa;
	return 0;
}