#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>

using namespace std;

long pow(long x, int n) {
    long ans = 1;
    while (n > 0) {
        if ((n & 1) == 1) {
            ans = ans * x;
        }
        x = x * x;
        n = n >> 1;
    }
    return ans;
}

int main() {

    int N, K;
    cin >> N >> K;
    int cnt = 0;
    if (N == K) {
        cnt = 1;
    } else if (N > K) {
        long tmp = pow(2, K);
        long tmp2 = pow(2, N);
        long i = 1;
        while (tmp * i <= tmp2) {
            cnt += 1;
            i += 1;
        }
    }

    cout << cnt << endl;

    return 0;
}