def solve():
  mod = 10**9+7
  p, k = map(int, input().split())
  r = pow(10,p-1,p)
  ans = (pow(10,p-1,mod)+p-r)*pow(p,mod-2,mod)
  if r<k:
    ans -= 1
  return ans%mod
print(solve())