#include <bits/stdc++.h>
using namespace std;
long long int powmod(long long int a, int b, int n) {
  long long int rm = 1;
  while (b) {
    if (b % 2) {
      rm = (rm * a) % n;
    }
    a = (a * a) % n;
    b /= 2;
  }
  return rm;
}
long long int dp[1010][110] = {0}, ways = 0, tpw[1010], cur;
int n, m, k;
int main() {
  cin >> n >> k >> m;
  long long int ans = 0, mul = 1;
  dp[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    dp[i][0] = 0;
    for (int j = 1; j < k; ++j) dp[i][j] = dp[i - 1][j];
    for (int j = 0; j < k; ++j) {
      for (int l = 1; l <= 9; ++l) {
        dp[i][(j + l * mul) % k] =
            (dp[i][(j + l * mul) % k] + dp[i - 1][j]) % m;
      }
    }
    if (i == n)
      ans = (ans * (long long int)9) % m;
    else
      ans = (ans * 10) % m;
    ans = (ans + dp[i][0]) % m;
    dp[i][0] = 1;
    mul = (mul * 10) % k;
  }
  cout << ans << endl;
  return 0;
}
