T2

//f[i][j]填了若干个数，各位之和为i,十进制下mod z为j
//yousiki讲的，喵
#include <iostream>
#include <algorithm>

const int P = 1000000007;
const int N = 50005;
const int M = 505;

int n, m, f[N][M];

int main() {
    std::cin >> n >> m;
    f[0][0] = 1;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            for (int k = 1; k < 10; ++k) {
                (f[i + k][(j * 10 + k) % m] += f[i][j]) %= P;
            }
        }
    }
    std::cout << f[n][0] << std::endl;
    return 0;
}