#include <bits/stdc++.h>

using namespace std;

#define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 2e7 + 5;

int n, mod, r;
int pre[N], suf[N];

int fast_pow ( int a, int b ) {
  int res = 1;
  while ( b ) {
    if ( b & 1 ) {
      res = res * a;
      res %= mod;
    }
    b >>= 1;
    a = a * a;
    a %= mod;
  }
  return res;
}

int exgcd ( int a, int b, int &x, int &y ) {
	if ( !b ) {
		x = 1, y = 0;
		return a;
	}
	int d = exgcd ( b, a % b, y, x );
	y -= a / b * x;
	return d;
}

int inv[N];

void Solve () {
  ios :: sync_with_stdio ( false );
  cin.tie ( 0 ), cout.tie ( 0 );
  cin >> n >> mod >> r;
  pre[0] = 1;
  for ( int i = 1; i <= min ( n, mod ); i ++ ) {
    pre[i] = pre[i - 1] * i;
    pre[i] %= mod;
  }
  suf[min ( 2 * min ( n, mod ), n ) + 1] = 1;
  for ( int i = min ( 2 * min ( n, mod ), n ); i >= 1; i -- ) {
    suf[i] = suf[i + 1] * i;
    suf[i] %= mod;
  }
  inv[1] = 1;
  for ( int i = 2; i <= mod; i ++ ) {
		inv[i] = ( mod - mod / i ) * inv[mod % i] % mod;
	}
  for ( int i = 1; i <= min ( 2 * min ( n, mod ), n ); i ++ ) {
    if ( pre[i - 1] * suf[i + 1] % mod == 0 ) {
      if ( !r && i > 1 ) {
        cout << i - 1 << " " << i;
        return ;
      }
      continue;
    }
    // for ( int j = 1; j < i; j ++ ) {
    //   if ( pre[i - 1] * suf[i + 1] % mod * j % mod == r ) {
    //     cout << j << " " << i << '\n';
    //     return ;
    //   }
    // }
    int tmp = inv[pre[i - 1] * suf[i + 1] % mod] * r % mod;
    if ( tmp < i && tmp ) {
      cout << tmp << " " << i;
      return ;
    }
  }
  cout << -1 << " " << -1;
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}