#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll dp[5001][496];

ll solve(ll k , ll f , ll x){
    if(k == 0){
        if(x == 0) return 0;
        return 1e9;
    }

    if(dp[k][x] != -1){
        return dp[k][x];
    }

    ll ans = 1e12;

    for(int i=1;i<10;i++){
        if(k >= i){
           ans = min(ans , solve(k-i , f , ((10 * x) + i) % f) + 1);
        }
    }

    return dp[k][x] = ans;
}

int main(){
    ll f , k;
    cin>>k>>f;

    memset(dp,-1,sizeof(dp));

    ll ans = solve(k,f,0);

    cout<<ans<<endl;
return 0;
}