def solve(K, N):
   if K == 1:
      return 1
   from fractions import Fraction
   from collections import defaultdict
   R = tuple(set(range(1, N+1)) - {13, 17, 19, 23})
   F = tuple(Fraction(1, x) for x in R)
   dp = defaultdict(int)
   dp[Fraction(0)] = 1
   for _ in range(K):
      ndp = defaultdict(int)
      for k, cnt in dp.items():
         for f in F:
            nkey = k+f
            if nkey <= 1:
               ndp[nkey] += cnt
      dp = ndp
   res = dp[Fraction(1)]
   if res in {13, 17, 19, 23}:
      res += 1
   return res
K, N = map(int, input().split())
ans = solve(K, N)
print(ans)