#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

i64 exgcd(i64 a, i64 b, i64 &x, i64 &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    i64 g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}

using i128 = __int128;

std::pair<i64, i64> merge(i64 m1, i64 a1, i64 m2, i64 a2) {
    i64 x, y;
    i64 g = exgcd(m1, m2, x, y);
    if ((a2 - a1) % g != 0) {
        return std::pair {0LL, 0LL};
    }
    i64 v = (a2 - a1) / g;
    i128 m = i128 {m1} / g * m2;
    i128 a = (i128 {x} * v % (m2 / g) * m1 + a1) % m;
    if (a < 0) {
        a += m;
    }
    m = std::min(m, i128(1E18) + 1);
    a = std::min(a, i128(1E18));
    return std::pair {m, a};
}

i64 pw10[15];
i64 dfs(i64 n, int c, int v, int len, int i, i64 m, i64 a) {
    if (a > n) {
        return 0LL;
    }
    i64 res = (n - a) / m + 1;
    if (a < pw10[len]) {
        res -= (pw10[len] - 1 - a) / m + 1;
    }
    for (int j = 1; j < i; j++) {
        int v1 = v % pw10[j];
        auto [m1, a1] = merge(m, a, (v1 + c) * pw10[j], v1);
        if (m1 == 0) {
            continue;
        }
        res -= dfs(n, c, v, len, j, m1, a1);
    }
    return res;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    pw10[0] = 1;
    for (int i = 1; i <= 14; i++) {
        pw10[i] = pw10[i - 1] * 10;
    }
    
    i64 n;
    int c;
    std::cin >> n >> c;
    
    i64 ans = 0;
    if (n == pw10[14]) {
        if (pw10[13] % c == 0) {
            ans++;
        }
        n--;
    }
    
    for (int len = 1; len <= 7; len++) {
        for (int v = len == 1 ? 0 : pw10[len - 1]; v < pw10[len]; v++) {
            ans += dfs(n, c, v, len, len, (v + c) * pw10[len], v);
        }
    }
    
    std::cout << ans << "\n";
    
    return 0;
}