#include <bits/stdc++.h>
using namespace std;
int const MAXN = 1000 + 2;
int const MAXK = 100 + 2;
int const MAXF = 2;
long long const UNDEF = -1;
long long n, k, m;
long long dp[MAXN][MAXK];
long long tk[MAXN], tm[MAXN];
long long solve(long long p, long long r, bool z) {
  if (r == 0 && !z) {
    if (p == n) return 1 % m;
    return (9 * tm[n - p - 1]) % m;
  }
  if (p >= n) return 0;
  long long &tmp = dp[p][r];
  if (tmp != UNDEF) return tmp;
  tmp = 0;
  for (long long d = 0; d <= 9; ++d) {
    tmp += solve(p + 1, (r + d * tk[p]) % k, !d);
    tmp %= m;
  }
  return tmp;
}
int main() {
  cin >> n >> k >> m;
  tm[0] = 1 % m;
  tk[0] = 1 % k;
  for (int i = 1; i < MAXN; ++i) {
    tm[i] = (tm[i - 1] * 10) % m;
    tk[i] = (tk[i - 1] * 10) % k;
  }
  fill(&dp[0][0], &dp[0][0] + MAXN * MAXK, UNDEF);
  cout << solve(0, 0, true) << endl;
  return 0;
}
