WA100 but WA 11#

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,p,b,m;
inline int q_pow(int a,int b,int p){
    int c=1;
    while (b){
        if (b&1) c=a*c%p;
        a=a*a%p;b>>=1;
    }
    return c;
}
map<int,int> mp;
signed main(){
    cin>>p>>b>>n;
    m=ceil(sqrt(p));
    int now=1;
    for (int i=0;i<=m;++i){
        if (!mp[n*now%p]) mp[n*now%p]=i+1;
        now=now*b%p;
    }
    now=q_pow(b,m,p);
    int tmp=now;
    for (int i=1;i<=m;++i){
        if (mp[now]){
            int ans=i*m-(mp[now]-1);
            cout<<(ans%p+p)%p<<"\n";
            return 0;
        }
        now=now*tmp%p;
    }
    cout<<"no solution\n";
    return 0;
}