#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll n,k,ans;
ll po(ll base,ll ti){
if(ti==0)return 1;
ll tmp=po(base,ti/2);
if(ti&1){
return tmp*tmp%MOD*base%MOD;
}
return tmp*tmp%MOD;
}
ll get(ll kk,ll id){
if(id>=64)return 0;
return ((kk>>id)&1);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>k;
--k;
REP(i,n){
ans=(ans+get(k,n-1-i)*po(2,i))%MOD;
}
cout<<(ans+1)%MOD<<"\n";
return 0;
}
