1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<cmath>
 5 using namespace std;
 6 #define ll long long
 7 const int mod=1048573;
 8 int hcnt=0,head[mod+10];
 9 struct Haha{
10     int val,id,next;
11 }hash[mod+10];
12 void insert(int x,int pos){
13     int k=x%mod;
14     hash[++hcnt].val=x;
15     hash[hcnt].id=pos;
16     hash[hcnt].next=head[k];
17     head[k]=hcnt;
18 }
19 int find(int x){
20     int k=x%mod;
21     for(int i=head[k];i;i=hash[i].next){
22         if(hash[i].val==x) return hash[i].id;
23     }
24     return -1;
25 }
26 ll ksm(int a,int b,int p){
27     int x=a;
28     ll ret=1;
29     if(b<0) return -1;
30     while(b){
31         if(b&1) ret=1ll*(ret*x)%p;
32         b>>=1;
33         x=1ll*x*x%p;
34     }
35     return ret;
36 }
37 int BSGS(int a,int b,int p){
38     int m=(int)(sqrt(p)+0.999999);
39     if(b==1) return 0;
40     if(a==b) return 1;
41     if(!b){
42         if(!a) return 1;
43         return -1;
44     }
45     ll x=1;
46     for(int i=1;i<=m;++i){
47         x=x*a%p;
48         insert(x,i);
49     }
50     ll inv=1;
51     int inv2=ksm(a,p-m-1,p)%p;
52     for(int i=0;i<m;++i){
53         int k=i*m;
54         if(inv==-1) return -1;
55         int ans=inv*b%p;
56         int jgy=find(ans);
57         if(~jgy){
58             return k+jgy;
59         }
60         inv=1ll*inv*inv2%p;
61     }
62     return -1;
63 }
64 void init(){
65     for(int i=0;i<mod;++i){
66         hash[i].val=-1;
67         hash[i].next=0;
68         hash[i].id=0;
69     }
70     memset(head,0,sizeof(head));
71     hcnt=0;
72 }
73 int main(){
74     int a,b,p;
75     while(~scanf("%d%d%d",&p,&a,&b)){
76         init();
77         int dove=BSGS(a,b,p);
78         if(~dove) printf("%d\n",dove);
79         else printf("no solution\n");
80     }
81     return 0;
82 }