#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const long long INF = 1LL << 62;
const long long MINF = -(1LL << 62);
template <typename T>
T getint() {
  T val = 0;
  char c;
  bool neg = false;
  while ((c = getchar()) && !(c >= '0' && c <= '9')) {
    neg |= c == '-';
  }
  do {
    val = (val * 10) + c - '0';
  } while ((c = getchar()) && (c >= '0' && c <= '9'));
  return val * (neg ? -1 : 1);
}
long long n, k, m;
long long dp[1001][101][2];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> m;
  dp[0][0][0] = 1;
  long long h = 1;
  for (int i = 0; i < n; ++i) {
    for (int p = 0; p < 2; ++p) {
      int start = 1;
      if (i == 0 || p == 0) start = 0;
      for (int j = start; j < k; ++j) {
        for (int l = 0; l < 10; ++l) {
          dp[i + 1][(j + l * h) % k][(l > 0) | p] += dp[i][j][p];
          dp[i + 1][(j + l * h) % k][(l > 0) | p] %= m;
        }
      }
    }
    h = h * 10 % k;
  }
  long long hatv = 1;
  long long ans = 0;
  for (int i = n; i >= 1; --i) {
    ans += (dp[i][0][1]) * hatv % m;
    ans %= m;
    if (i == n)
      hatv *= 9;
    else
      hatv *= 10;
    hatv %= m;
  }
  cout << ans << "\n";
  return 0;
}
