终于对了!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

#include<bits/stdc++.h>
using namespace std;
typedef long long op;
int main()
{
freopen("csp2022pj_pow.in","r",stdin);freopen("csp2022pj_pow.out","w",stdout);
op a,b;
cin>>a>>b;
if(pow(a,b)>1000000000)cout<<-1;
else cout<<(int)pow(a,b);
return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{freopen("csp2022pj_pow.in","r",stdin);
freopen("csp2022pj_pow.out","w",stdout);
int a,b;
cin>>a>>b;
if(pow(a,b)<1000000000) cout<<int(pow(a,b));
else cout<<"-1";
fclose(stdin);fclose(stdout);
return 0;}

666

#include <bits/stdc++.h>
#include<map>
using namespace std;
struct nxx {
int cost;
int pc;
string st;
bool operator < (const nxx &tmp)const {
return this->pc > tmp.pc ;
}
nxx (int a,int b,string c) {
pc=a;
cost=b;
st=c;
}
};
int x,y;
map <string, bool> mp;
map <string, int> dis;
int dx[4] = {0, 1, -1, 0};
int dy[4] = {1, 0, 0, -1};
string s;
char goal[10]="123804765";
int mubiao;
int gj(string jntm) {
int ans = 0;
for (int i = 0; i < 9; i ++ ) {
if (goal[i] != jntm[i] && goal[i] != 0) ans