#include<map>

#include<cmath>

#include<cstdio>

#include<iostream>

#include<algorithm> 

using namespace std;

typedef long long LL;

map<int,int>mp;

void read(int &x)

{

    x=; char c=getchar();

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) { x=x*+c-''; c=getchar(); }

}

int get_gcd(int a,int b) { return !b ? a : get_gcd(b,a%b); }

int Pow(int a,int b,int mod)

{

    int res=;

    for(;b;a=1LL*a*a%mod,b>>=)

        if(b&) res=1LL*res*a%mod;

    return res;

}   

int ex_BSGS(int A,int B,int C)

{

    if(B==) return ;

    int k=,tmp=,d;

    while()

    {

        d=get_gcd(A,C);

        if(d==) break;

        if(B%d) return -;

        B/=d; C/=d;

        tmp=1LL*tmp*(A/d)%C;

        k++;

        if(tmp==B) return k;

    }

    mp.clear();

    int mul=B;

    mp[B]=;

    int m=ceil(sqrt(1.0*C));

    for(int j=;j<=m;++j)

    {

        mul=1LL*mul*A%C;

        mp[mul]=j;

    }

    int am=Pow(A,m,C);

    mul=tmp;

    for(int j=;j<=m;++j)

    {

        mul=1LL*mul*am%C;

        if(mp.count(mul)) return j*m-mp[mul]+k;

    }

    return -;

}

int main()

{

    int A,C,B;

    int ans;

    while()

    {

        read(A); read(B); read(C);

        if(!A) return ;

        ans=ex_BSGS(A,B,C);

        if(ans==-) puts("No Solution");

        else cout<<ans<<'\n';

    }

}