#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

ll euclid(ll a, ll b, ll &x, ll &y) {
	if (!b) return x = 1, y = 0, a;
	ll d = euclid(b, a % b, y, x);
	return y -= a/b * x, d;
}

ll crt(ll a, ll m, ll b, ll n) { //assumes nm<=1e18
	if (n > m) swap(a, b), swap(m, n);
	ll x, y, g = euclid(m, n, x, y);
	assert((a - b) % g == 0); // else no solution
	x = (b - a) % n * x % n / g * m + a;
	return x < 0 ? x + m/g*n : x;
}

ll inv(ll x,ll mod)
{
	ll a,b;
	euclid(x,mod,a,b);
	a%=mod;
	if (a<0) a+=mod;
	return a;
}

ll n,c,cn[20][N];
int sufr[20],dig[20];

void addRes(ll&u,ll&mo,ll ma,ll mu,ll dod,ll nm) //nm<=suf+c<1e9, mo<=ma, ma*nm<=1e18 -> mo*nm<=1e18
{
	if (mo==ma)
	{
		if (((u%nm)*mu+dod)%nm)
		{
			u=-1;
		}
		return;
	}
	ll g=gcd(mu,nm);
	if (dod%g)
	{
		u=-1;
		return;
	}
	mu/=g;
	nm/=g;
	dod/=g;
	ll req=((nm-dod%nm)*inv(mu%nm,nm))%nm;
	if ((u-req)%gcd(mo,nm))
	{
		u=-1;
		return;
	}
	ll re=crt(u,mo,req,nm);
	if (re>ma)
	{
		u=-1;
		return;
	}
	u=re;
	mo=min(ma,lcm(mo,nm));
}

ll leqmo(ll x,ll u,ll m)
{
	if (u==0) return x/m;
	else return (x+m-u)/m;
}

void rek(int i,int mask,ll u,ll mo,ll ma,ll mul,ll dod)
{
	if (i==0)
	{
		//cout<<i<<' '<<mask<<' '<<u<<' '<<mo<<' '<<ma<<en;
		ll l=1,r=10,lp=1;
		int lsuf=__lg(mask);
		while (l<=ma) //l .. r-1
		{
			cn[lp+lsuf][mask]+=leqmo(min(r-1,ma),u,mo)-leqmo(l-1,u,mo);
			l*=10;
			r*=10;
			++lp;
		}
		return;
	}
	rek(i-1,mask,u,mo,ma,mul*10,dod*10+dig[i-1]);
	addRes(u,mo,ma,mul,dod,sufr[i]+c);
	if (u==-1) return;
	rek(i-1,mask+(1<<i),u,mo,ma,mul*10,dod*10+dig[i-1]);
	//if (r<=ma) rek(i-1,mask+(1<<i),r,ma);
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>c;
	for (int suf=0;suf<1e7;++suf)
	{
		memset(dig,0,sizeof(dig));
		ll cc=suf,l=0,p10=1;
		while (cc)
		{
			dig[l]=cc%10;
			cc/=10;
			++l;
			p10*=10;
		}
		ll p101=10;
		for (int i=1;i<=15;++i)
		{
			sufr[i]=suf%p101;
			p101*=10;
		}
		for (int l0=0;;++l0,p10*=10)
		{
			if (l+l0==0) continue;
			ll os=n/p10;
			if (suf>n%p10) --os;
			ll rr=suf+c;
			if (rr>os) break;
			rek(l+l0-1,1<<(l+l0),0,rr,os,10,dig[l+l0-1]);
		}
	}
	ll odd=0;
	for (int le=1;le<=15;++le)
	{
		ll cu=0;
		for (int b=1;b<(1<<le);++b)
		{
			if (__builtin_popcount(b)%2) cu+=cn[le][b];
			else cu-=cn[le][b];
		}
		//cout<<le<<' '<<cu<<en;
		odd+=cu;
	}
	cout<<odd<<en;
}