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

#define ll long long

ll MOD = 1000000007;

ll solve(vector<ll>& mod, ll p, ll k){
    vector<vector<ll>> dp (k,vector<ll>(p,0));

    for (int i=0;i<10;i++){
        dp[0][(mod[0]*i)%p] += 1;
    }
    for (int c=1;c<k;c++){
        for (int pos =0;pos<p;pos++){
            for (int i=0;i<10;i++){
                ll a = (((pos-mod[c]*i)%p) + p)%p;
                ll x = dp[c-1][a];
                dp[c][pos] += x;
                dp[c][pos] = dp[c][pos]%MOD;
            }
        }
    }
    return dp[k-1][0];
}



int main(){
    int K,P;
    cin>>K>>P;
    vector<ll> mod10(K,1);
    for (int i=1;i<K;i++){
        mod10[i]=(mod10[i-1]*10)%P;
    }

    if (P==2 || P==5){
        
        ll sum = 0;
        ll pow10 = 1;
        for (int i=0;i<=K-2;i++){
            sum = (sum+pow10)%MOD;
            if (i%2==0){
                pow10 = (pow10*10)%MOD;
            }
        }


        ll total;
        if (P==2){
            total = sum*4 + 5;
        }
        else{
            total = sum + 2;
        }
        cout<<total;
        return 0;
    }

    if (K == 1){
        cout << 10/P + 1 << "\n";
        return 0;
    }

    ll total = 0;

    vector<ll> mod ((K+1)/2,0);
    for (int i =0;i<K/2;i++){
        mod[i]=mod10[i]+mod10[K-i-1];
    }
    if (K%2==1){
        mod[K/2] = mod10[K/2];
    }

    ll k = (K+1)/2;

    total = solve(mod,P,k);


    K=K-1;

    vector<ll> mod2 ((K+1)/2,0);
    for (int i =0;i<K/2;i++){
        mod2[i]=mod10[i]+mod10[K-i-1];
    }
    if (K%2==1){
        mod2[K/2] = mod10[K/2];
    }

    k = (K+1)/2;
    total = (total + solve(mod2,P,k))%MOD;



    cout<<total-1;
    return 0;
    
}