#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<set>

 #include<cmath>

 using namespace std;

 const int maxn = 1e4 + ;

 typedef long long ll;

 int T, n, m;

 int a[maxn];

 int main()

 {

     int x;

     while(cin >> n >> m >> x && (n + m + x))

     {

         memset(a, , sizeof(a));

         a[] = , a[] = ;

         bool flag = ;

         int start, len;

         for(int i = ; ; i++)

         {

             a[i] = n * a[i - ] + m * a[i - ];

             a[i] %= ;

             for(int j = ; j <= i - ; j++)

             {

                 if(a[j] == a[i - ] && a[j + ] == a[i])

                 {

                     flag = ;

                     start = j;

                     len = i - j - ;

                 }

                 if(flag)break;

             }

             if(flag)break;

         }/*

         for(int i = 1; i < start; i++)cout<<a[i]<<" ";

         for(int i = start; i <= start + len; i++)cout<<a[i]<<" ";

         cout<<endl;

         cout<<start<<" "<<len<<endl;*/

         if(x <= start)cout<<a[x]<<endl;

         else cout<<a[start + (x - start) % len]<<endl;

     }

     return ;

 }