#include <bits/stdc++.h>
using namespace std;

ifstream f("lgput.in");
ofstream g("lgput.out");

const long long MOD = 1999999973;
long long n, p;

inline void solve()
{
    long long ans = 1, x = n, pr = n;
    while(p > 0)
    {
        if(p&1==1)
        {
            ans*=x;
        }
        x*=pr;
        p>>=1;
    }
    g << x;
}

int main()
{
    f >> n >> p;
    solve();
}