#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
#define double long double
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int a, b;
int power(int a, int b)
{
	int ans = 1; 
	while(b)
	{
		if(b & 1)
		{
			ans = ans * a;
		}
		a = a * a;
		b >>= 1;
	}
	return ans;
}
signed main()
{
	cin >> a >> b;
	cout << power(a, b) << endl;
	return 0;
}

当我写完题才发现要用递归...