#include <bits/stdc++.h>
using namespace std;
int Int() {
  int x;
  scanf("%d", &x);
  return x;
}
long long Long() {
  long long x;
  scanf("%lld", &x);
  return x;
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << ' ';
  err(++it, args...);
}
const int N = (int)2e5 + 5;
const int maxN = (int)1e6 + 6;
const long long Mod = (long long)1e9 + 7;
const int inf = (int)2e9;
const long long Inf = (long long)1e18;
long long dp[1000][100], radix[1001];
int n, k, m;
void modpow() {
  radix[0] = 1;
  for (int i = 1; i <= 1000; ++i) radix[i] = (radix[i - 1] * 10LL) % m;
}
long long call(int idx, int mod, int par, int ten) {
  if (idx == n) return !mod and par;
  if (mod == 0 and par) return (9LL * radix[n - idx - 1]) % m;
  long long& ret = dp[idx][mod];
  if (~ret) return ret;
  ret = 0;
  for (int i = 0; i <= 9; ++i)
    ret =
        (ret + call(idx + 1, (ten * i + mod) % k, par | i, (ten * 10) % k)) % m;
  return ret;
}
int main() {
  int test = 1, tc = 0;
  while (test--) {
    n = Int(), k = Int(), m = Int();
    memset(dp, -1, sizeof dp);
    modpow();
    cout << call(0, 0, 0, 1) << '\n';
  }
  return 0;
}
