{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', '推荐 weizai888 的文章《快速模幂(c++)》','https://www.xiaopingtou.net/article-52126.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
#include
using namespace std;
long long quickpow(long long m, long long n, long long k)
{
long long ans = 1;
while (n)
{
if (n & 1)
ans = (ans * m) % k;
n = n >> 1;
m = (m*m) % k;
}
return ans;
}
int main()
{
long long m, n, k;
cin >> m >> n >> k;
cout<