//1<=x<=2^N(xは2^Mの倍数) //を満たすxの個数 #include #include using namespace std; int main(){ long long N,M,twoN,twoM; cin>>N>>M; twoN=pow(2,N); twoM=pow(2,M); cout<