#include <cstdio>
#include <algorithm>

using namespace std;

long long po[32], v[32];
int tot = 0;

long long a, b;

long long bec (int k)
{
    if (!k) return 1LL;

    if (v[k] < a) return 0LL;

    long long rez = 1LL * (v[k] - a) * po[k - 1];

    rez += bec (k - 1);

    return rez;
}

int main ()
{
  //  freopen ("file.in", "r", stdin);

    scanf ("%lld %lld", &a, &b);
    b -= 1LL;

    if (a > 9LL)
    {
        printf ("0\n");
        return 0;
    }

    po[0] = 1LL;
    for (int i = 1; i <= 20; ++i)
        po[i] = 1LL * (9LL - a + 1LL) * po[i - 1];

    for (; b > 0LL; b /= 10LL)
        v[++tot] = b % 10LL;

    long long sol = 0LL;
    for (int i = 1; i <= tot; ++i)
        sol += bec (i);

    printf ("%lld\n", sol);

    return 0;
}