#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int n,mod,r;
int qkp(int b,int p){
	int r=1;
	while(p){
		if(p&1)(r*=b)%=mod;
		p/=2;
		(b*=b)%=mod;
	}
	return r;
}
signed main(){
	n=read(),mod=read(),r=read();
	if(n>=2*mod){
		if(!r){
			printf("%lld %lld\n",1,n);
		}
		else{printf("-1 -1\n");}
		return 0;
	}
	if(n>=mod){
		int v=1;
		for(int i=1;i<mod;i++)v*=i,v%=mod;
		for(int i=mod+1;i<=n;i++)v*=i,v%=mod;
		if(!r){
			if(mod==2){
				if(n==2){printf("-1 -1\n");}
				else printf("1 3\n");
			}
			else{
				printf("1 2\n");
			}
		}
		else{
			printf("%lld %lld\n",r*qkp(v,mod-2)%mod,mod);
		}
		return 0;
	}
	if(!r){printf("-1 -1\n");return 0;}
	//n<1e7.
	int f=1;
	int xd=qkp(r,mod-2);
	for(int i=1;i<=n;i++)f*=i,f%=mod;
	xd*=f;xd%=mod;
	int cur=0,cur2=0;
	for(int i=1;i<n;i++){
		cur2+=f;
		if(cur2>=mod)cur2-=mod;
		cur+=xd;
		if(cur>=mod)cur-=mod;
		if(i<cur&&cur<=n){
			printf("%lld %lld\n",i,cur);return 0;
		}
		//p/r.
	}
	printf("-1 -1\n");
	return 0;
}