#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll dim=4e6 + 10;
const ll mod= 1e9+7;
const ll inf=1e18+77;
//#define endl "\n"
#define fi first
#define pb push_back
#define se second
#define vll vector<ll>
ll n, k, q;
ll cnt=0;
ll pw[dim];
void place(ll pos, ll j){
cnt=pos%mod;
k--;
if(k==0)return;
for(ll i=max(n-60,j+1); i<=n-1; i++){
ll st=n-1-i;
if(st>=61)continue;
st=(1ll<<st);
if(k-(st)>=0){
k-=(st-1);
st=pw[i];
place((pos%mod+(st))%mod, i);
break;
}
}
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll tt;
//cin>>tt;
tt=1;
pw[0]=1;
for(int i=1; i<=2e6; i++){
pw[i]=(pw[i-1]*2)%mod;
}
while(tt--){
ll x, y;
cin>>n>>k;
place(1, -1);
cout<<cnt<<endl;
}
return 0;
}
