快速幂
#include<bits/stdc++.h>
using namespace std;
const int N = 1000;//取模的数值
long long n,m;
long long fastPower(long long base, long long power)
{
long long result = 1;
while(power > 0)
{
if(power & 1) result = result*base%N;
power >>= 1;
base = (base*base)%N;
}
return result;
}
int main()
{
while(cin >> n >> m)
{
cout << fastPower(n,m) <<endl;
}
return 0;
}