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

// c++ short types
#define Int long long
#define vt vector

int mod;
int mul(int a, int b) {
	return (a * 1ll * b) % mod;
}

const int nmax = 2 * 1e7 + 1;
int inv[nmax], fact[nmax], suff[nmax];

void solver() {
	Int n;
	int p, r;
	cin >> n >> p >> r;
	mod = p;
	if(n >= 2 * p) {
		if(r == 0) {
			cout << p << " " << p-1 << "\n";
		} else {
			cout << "-1 -1\n";
		}
		return ;
	}
	inv[1] = 1;
	for(int a = 2; a < min(p, nmax); ++a) {
		inv[a] = p - (long long)(p/a) * inv[p % a] % p; 
	}
	fact[0] = 1;
	for(int i = 1; i <= n; ++i) {
		fact[i] = mul(fact[i-1], i);
	}
	suff[n+1] = 1;
	suff[n] = n % p;
	for(int i = n-1; i >= 0; --i) {
		suff[i] = mul(i, suff[i+1]);
	}
	for(int i = 2; i <= n; ++i) {
		int val = mul(fact[i-1], suff[i+1]);
		if(val == 0) {
			if(r == 0) {
				cout << i << " " << i-1 << "\n";
				return ;
			} else {
				continue;
			}
		}
		assert(val >= 0 && val < p);
		int d = mul(r, inv[val]);
		if(1 <= d && d < i) {
			cout << i << " " << d << endl;
			return ;
		}
	}
	cout << "-1 -1\n";
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int tt = 1;
	for(int t = 0; t < tt; ++t) {
    solver();
	}
	return 0;
}