#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
using ll = long long;

int main() {
	ll n, k; cin >> n >> k;
	ll bs = 1LL << k, lm = 1LL << n;
	ll lo = 0, hi = 1LL << n + 1;
	while (hi - lo > 1) {
		ll mid = lo + (hi - lo) / 2;
		if (bs*mid > lm) hi = mid;
		else lo = mid;
	}
	cout << lo << endl;
	return 0;
}