#include <iostream>
#include <cmath>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");
long long ridicare(long n,long long k)
{
    long long total=0;
    if(k==0)
        return 1;
    if(k%2==0)
    {
        total=ridicare(n,k/2);
        total=total*total;
        return total;
    }
    else
    {
        total=ridicare(n,k/2);
        total=total*total;
        return total*n;
    }
}
int main()
{
    long long n,k;
    fin>>n>>k;
    fout <<ridicare(n,k)<< endl;
    return 0;
}