#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int mod=998244353;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}

int m,k;

int f(int r, int n){
    return mul(sub(1,Pow(r,n)),Pow(sub(1,r)));
}

int solve(int n, int cur){
    if(n==0) return 1;
    int g=__gcd(cur,m),g2=__gcd(1ll*cur*k,(ll)m);
    if(g!=g2) return sub(mul(g,Pow(m-1,n-1)),solve(n-1,1ll*cur*k%m));
    int res=sub(mul(g,f(sub(0,m-1),n)),1);
    if(n%2==0) res=sub(0,res);
    return res;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int n; cin >> n >> m >> k; k%=m;
    cout << solve(n,1) << "\n";
}