#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define For(i, a, n) for(ll i=a;i<n;i++)
#define vec vector
#define sz(x) (ll)x.size()
#define all(x) begin(x), end(x)

template<class A, class B>
pair<A, B>operator+(const pair<A, B>&a, const pair<A, B>&b){
    return {a.first + b.first, a.second + b.second};
}

template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&p){
    return os<<"("<<p.first<<", "<<p.second<<")";
}

template<class A, class B, class C>
basic_ostream<A, B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto i=begin(c);i!=end(c);++i){
        os<<(i==begin(c)?"":" ")<<*i;
    }
    return os;
}

template<typename... Args>
void dbg(Args&&... args){
    ((cerr<<args<<" |"),...);
    cerr<<endl;
}
#define mod 1000000007
void solve(){
    ll k, p;cin>>k>>p;
    vec<ll> m(k);
    m[0] = 1;
    For(i, 1, k)m[i] = (m[i-1]*10)%p;
    // dbg(m);
    ll ans = 1;
    vec<vec<ll>> dp(2, vec<ll>(p));
    For(l, 1, k+1){
        ll minca = m[0] + m[l-1];
        if(l == 1)minca/=2;
        vec<ll>dp1(p);
        For(nas, 1, 10){
            For(i, 0, p){
                ll ind =(i+minca*nas)%p;
                dp1[ind] += dp[l%2][i];
                dp1[ind]%=mod;
            }
            dp1[(minca*nas)%p] = (dp1[(minca*nas)%p] + 1)%mod;
        }

        ans += dp1[0];
        ans %= mod;
        For(i, 0, p){
            dp1[i] =(dp1[i] +  dp[l%2][i])%mod;
        }

        vec<ll>dp2(p);
        For(i, 0, p){
            dp2[(i*10)%p] =(dp2[(i*10)%p] + dp1[i])%mod;
        }

        dp[l%2] = dp2;
    }
    cout<<ans<<endl;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    ll t = 1;//cin>>t;
    while(t--)solve();
}