{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 626qinxiaomei 的文章《64位数乘法》','https://www.xiaopingtou.net/article-81002.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
#include
using namespace std;
long long int fun(long long int a,long long int b,long long int p)
{ //大数a*bmolp
long long int ans = 0;
int flag = 1;
if(a<0)
flag = -flag;
if(b<0)
flag = -flag;
while(b!=0)
{
if(b&1!=0)
{
ans = (ans+a)%p;
}
a = (a*2)%p;
b>>=1;
}
return ans;
}
int main()
{
long long int a,b,p;
cin>>a>>b>>p;
cout<