#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
using namespace std;
using ll = long long;

constexpr ll MOD = 1000000007;

vector<ll> pows_10;

void mod_add(ll& a, ll b) {
		a = (a + b) %MOD;
}

int main() {
		ll k, p; cin >> k >> p;
		pows_10 = vector<ll>(k+5);
		pows_10[0] = 1;
		for (int i = 1;i <= k+3; i++) {
				pows_10[i] = pows_10[i-1] * 10 % p;
		}

		vector<vector<int>> dp(k+5, vector<int>(p+5, 0));

		long long res = 0;

		for(int i=0; i<10; i++){
				dp[1][i%p] += 1;
				if(i%p==0) res++;
				if(k>1){
						dp[2][(i + 10*i)%p] += 1;
						if((i + 10*i)%p==0 && i!=0) res++;
				}
		}

		for(int i = 1; i<=k-2; i++){
				for(int j=0; j<p; j++){
						for(int d= 0; d<10; d++){
								long long nv = 10*j+d+pows_10[i+1]*d;
								nv %= p;
								dp[i+2][nv] += dp[i][j];
								dp[i+2][nv] %= MOD;
								if(d>0 && nv==0) res = (res +  dp[i][j])%MOD;
						}
				}
		}

		cout << res << endl;
}