//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=999911659;
ll inv(ll x)
{
	if(x==1) return 1;
	return (mod-mod/x)*inv(mod%x)%mod;
}
ll n,p;
ll nxt[505];
int vis[505];
ll c[505];
ll dp[505][10][505];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>p;
	for(int i=0;i<p;i++)
		nxt[i]=(i*10+1)%p;
	int cur=0;
	vector<ll> vec;
	ll times=n+1;
	ll rem;
	while(times&&!vis[cur])
	{
		c[cur]++;
		vec.pb(cur);
		times--;
		vis[cur]=1;
		rem=cur;
		cur=nxt[cur];
	}
	if(times)
	{
		int p=-1;
		for(int i=0;i<sz(vec);i++)
			if(vec[i]==cur)
				p=i;
		ll round=sz(vec)-p;
		for(int i=p;i<sz(vec);i++)
			c[vec[i]]+=times/round;
		rem=vec.back();
		for(int i=p;i<p+times%round;i++)
		{
			rem=vec[i];
			c[vec[i]]++;
		}
	}
	dp[0][1][rem]=1;
	for(int i=0;i<p;i++)
		for(int c=0;c<=8;c++)
		{
			ll ways=1;
			for(int x=0;x<c;x++)
				ways=ways*((::c[i]+x)%mod)%mod*inv(x+1)%mod;
			for(int a=1;a+c<=9;a++)
				for(int b=0;b<p;b++)
					dp[i+1][a+c][(b+c*i)%p]=(dp[i+1][a+c][(b+c*i)%p]+dp[i][a][b]*ways)%mod;
		}
	cout<<dp[p][9][0]<<'\n';
	return 0;
}