#!/usr/bin/env python
# -*- coding: utf-8 -*-

M,D = map(int,input().split())
length = 200
dp = [[False for i in range(1800)] for j in range(length)]
dp[0][0] = 1
for i in range(1,10):
    dp[0][i] = 1
for n in range(1,length):
    dp[n] = dp[n-1]+[]
    for i in range(1,10):
        for d in range(1800)[::-1]:
            if d+i < 1800 and dp[n-1][d] is not False: 
                dp[n][d+i] += dp[n-1][d]

M_count = [0 for i in range(1800)]
for digit,i in list(enumerate(list(str(M))[::-1]))[::-1]:
    if digit == 0:
        for j in range(1,int(i)+1):
            M_count[j] = 1
        break
    for j in range(1,1800):
        M_count[j] += dp[digit-1][j] * int(i)

D_count = [0 for i in range(1800)]
for digit,i in list(enumerate(list(str(D))[::-1]))[::-1]:
    if digit == 0:
        for j in range(1,int(i)+1):
            D_count[j] = 1
        break
    for j in range(1800):
        D_count[j] += dp[digit-1][j] * int(i)

ans = 0
for i in range(1800):
    ans += M_count[i] * D_count[i]
print(ans)