#include<cstdio>
#include<cstring>
#define mx 50
#define LL long long
struct gaojing{int len;int a[mx+10];
}f[30][20][14][12];
int n,k;
inline int max(int a,int b){return a>b?a:b;}
inline int min(int a,int b){return a<b?a:b;}
inline void set0(gaojing &s)
{s.len=0;for (int i=1;i<mx+5;i++)s.a[i]=0;
}
inline void put(gaojing a)
{for (int i=a.len;i>=1;i--)printf("%d",a.a[i]);printf("\n");
}
inline void addi(gaojing a,gaojing b,gaojing &c)
{set0(c);int maxlen=max(a.len,b.len);  for (int i=1;i<=maxlen;i++)  {  c.a[i]=c.a[i]+a.a[i]+b.a[i];  if (c.a[i]>=10)  {  c.a[i+1]+=c.a[i]/10;c.a[i]%=10;}}  c.len=maxlen+1;  while (!c.a[c.len]&&c.len>1) c.len--;
}
inline void jian(gaojing a,gaojing b,gaojing &c)
{set0(c);for (int i=1;i<=b.len;i++){c.a[i]=a.a[i]-b.a[i];if (c.a[i]<0){c.a[i]+=10;int now=i+1;while (!a.a[now]){a.a[now]=9;now++;}a.a[now]--;}}for (int i=b.len+1;i<=a.len;i++)c.a[i]=a.a[i];c.len=a.len;while (c.a[c.len]==0&&c.len>1)c.len--;
}
inline void mult(gaojing a,gaojing b,gaojing &c)
{set0(c);for(int i=1;i<=a.len;i++)for (int j=1;j<=b.len;j++)c.a[i+j-1]+=a.a[i]*b.a[j];int mxlen=a.len+b.len+3;for (int i=1;i<=mxlen;i++){c.a[i+1]+=c.a[i]/10;c.a[i]%=10;}while (c.a[mxlen]==0)mxlen--;c.len=mxlen;
}
const int prime[5]={0,2,3,5,7};
int num[5];
int main()
{freopen("digit.in","r",stdin);freopen("digit.out","w",stdout);scanf("%d%d",&n,&k);if (k==0)//若k=0，方案数为10^n-9^n {gaojing sum;set0(sum);gaojing tomul;set0(tomul);gaojing decs;set0(decs);sum.len=1;sum.a[1]=1;tomul.len=1;tomul.a[1]=9;decs.len=n+1;decs.a[n+1]=1;for(int i=1;i<=n;i++)mult(sum,tomul,sum);jian(decs,sum,sum);put(sum);return 0;}for (int i=1;i<=4;i++)while (k%prime[i]==0){k/=prime[i];num[i]++;}if (k!=1){printf("0");return 0;}f[0][0][0][0].a[1]=1;f[0][0][0][0].len=1;for (int i=0;i<=num[1];i++)for (int j=0;j<=num[2];j++)for (int k=0;k<=num[3];k++)for (int l=0;l<=num[4];l++)f[i][j][k][l].len=1;for (int i=1;i<=n;i++){int m2=min(num[1],3*i);int m3=min(num[2],2*i);int m5=min(num[3],i);int m7=min(num[4],i);for (int j=m2;j>=0;j--)for (int k=m3;k>=0;k--)for (int l=m5;l>=0;l--)for (int m=m7;m>=0;m--){if (j>=1)addi(f[j][k][l][m],f[j-1][k]  [l]  [m]  ,f[j][k][l][m]);//2if (k>=1)addi(f[j][k][l][m],f[j]  [k-1][l]  [m]  ,f[j][k][l][m]);//3if (j>=2)addi(f[j][k][l][m],f[j-2][k]  [l]  [m]  ,f[j][k][l][m]);//4if (l>=1)addi(f[j][k][l][m],f[j]  [k]  [l-1][m]  ,f[j][k][l][m]);//5if (j&&k)addi(f[j][k][l][m],f[j-1][k-1][l]  [m]  ,f[j][k][l][m]);//6if (m>=1)addi(f[j][k][l][m],f[j]  [k]  [l]  [m-1],f[j][k][l][m]);//7if (j>=3)addi(f[j][k][l][m],f[j-3][k]  [l]  [m]  ,f[j][k][l][m]);//8if (k>=2)addi(f[j][k][l][m],f[j]  [k-2][l]  [m]  ,f[j][k][l][m]);//9}}put(f[num[1]][num[2]][num[3]][num[4]]);
}