#include <cstdio>

#include <algorithm>

using namespace std;

typedef long long LL;

const int N=100000;

const LL mod=1e9+7;

LL a[N],u;

int p[N],n,m;

void FWT(LL*a,int n){

    for(int d=1;d<n;d<<=1)for(int m=d<<1,i=0;i<n;i+=m)for(int j=0;j<d;j++){

        LL x=a[i+j],y=a[i+j+d];

        a[i+j]=(x+y)%mod,a[i+j+d]=(x-y+mod)%mod;

    }

}

void UFWT(LL*a,int n){

    for(int d=1;d<n;d<<=1)for(int m=d<<1,i=0;i<n;i+=m)for(int j=0;j<d;j++){

        LL x=a[i+j],y=a[i+j+d];

        a[i+j]=(x+y)%mod*u%mod,a[i+j+d]=(x-y+mod)%mod*u%mod;

    }

}

LL pow(LL a,LL b,LL p){LL t=1;for(a%=p;b;b>>=1LL,a=a*a%p)if(b&1LL)t=t*a%p;return t;}

int main(){

    for(int i=2;i<=50000;i++)p[i]=1;

    for(int i=2;i<=50000;i++)if(p[i]){

        for(int j=2;i*j<=50000;j++)p[i*j]=0;

    }u=pow(2,mod-2,mod);

    while(~scanf("%d%d",&n,&m)){

        int len=1;while(len<=m)len<<=1;

        for(int i=0;i<len;i++)a[i]=p[i]&(i<=m);

        FWT(a,len);

        for(int i=0;i<len;i++)a[i]=pow(a[i],n,mod);

        UFWT(a,len);

        printf("%lld\n",a[0]);

    }return 0;

}