#include <bits/stdc++.h>
using namespace std;
long long dp[1100][110], p[1100][15], f[1100];
int main() {
  long long n, m, mod;
  cin >> n >> m >> mod;
  if (mod == 1) {
    cout << 0 << endl;
    return 0;
  }
  for (long long j = 1; j <= 9; j++) {
    p[1][j] = j % mod;
  }
  for (long long i = 2; i <= n; i++) {
    for (long long j = 1; j <= 9; j++) {
      p[i][j] = p[i - 1][j] * 10 % m;
    }
  }
  f[0] = 1;
  f[1] = 9;
  for (long long i = 2; i <= n; i++) {
    f[i] = f[i - 1] * 10 % mod;
  }
  for (long long i = 1; i <= 9; i++) (dp[1][i % m] += 1) %= mod;
  long long res = 0;
  for (long long i = 1; i < n; i++) {
    for (long long j = 1; j <= 9; j++) (dp[i + 1][p[i + 1][j] % m] += 1) %= mod;
    for (long long j = 1; j < m; j++)
      if (dp[i][j]) {
        for (long long k = 0; k <= 9; k++) {
          (dp[i + 1][(j + p[i + 1][k]) % m] += dp[i][j]) %= mod;
        }
      }
  }
  for (long long i = 1; i <= n; i++) {
    (res += dp[i][0] * f[n - i]) %= mod;
  }
  cout << res << endl;
}
