#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+ 7; 
int qpow(int a,int b,int p = mod) {
	int base = a,res = 1;
	while (b) {
		if (b & 1) {
			res = res * base % p;
		} 
		b >>= 1;
		base = base * base % p;
	}
	return res%p;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,p,r;
	cin >> n >> p >> r;
//	cout << qpow(2,4,1e9 + 7) <<endl;
	if(n>=2*p){
		if(r==0) cout << 2 << " " << 1 << "\n";
		else cout << -1 << " " << -1 << "\n";
	}
	else if(n<2*p && n>=p){
		if(r==0){
			if(n==p){
				if(n==2) cout << -1 << " " << -1 << "\n";
				else cout << p-1 << " " << p-2;
			}
			else cout << p+1 << " " << p << "\n";
		}
		else{
			int qf=1;
			for(int i=1; i<=n; i++){
				if(i!=p) qf=(qf*i)%p;
			}
			int da=1,flag=0;
			while(da<p){
				if(qf*da%p==r){
					flag=1;
					break;
				} 
				da++;
			}
			if(flag) cout << p << " " << da << "\n";
			else cout << -1 << " " << -1 << "\n";
		}
	}
	else{
		int qf=r;
		for(int i=1; i<=n; i++){
			qf=((qf)*qpow(i,p-2,p))%p;
//			cout << qf << "\n";
		}
		int wz=-1,zhi=-1;
		for(int i=1; i<=n; i++){
			if((qf*i)%p<i && (qf*i)%p!=0){
				wz=i;
				zhi=qf*i%p;
				break;
			}
		}
		if(!(zhi==-1 && wz==-1)) cout << wz << " " << zhi << "\n";
		else cout << -1 << " " << -1 << "\n";
	}
	return 0;
}