#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long MOD = 1000000007;
long long n, m, k, p[1002], dp[1002][102][2][2];
long long solve(long long idx, long long rem, bool f, bool zero) {
  if (idx == n) return f;
  if (dp[idx][rem][f][zero] != -1) return dp[idx][rem][f][zero];
  long long ans = 0;
  for (long long z = ((idx == (n - 1)) ? 1 : 0); z < 10; ++z) {
    long long h = (rem + (z * p[idx]) % k) % k, nz = (zero | (!(!z)));
    ans = (ans + solve(idx + 1, h, f | ((!h) & nz), nz)) % m;
  }
  return dp[idx][rem][f][zero] = ans % m;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> m;
  memset(dp, -1, sizeof dp);
  p[0] = 1;
  for (long long i = 1; i <= 1000; ++i) p[i] = (p[i - 1] * 10LL) % k;
  cout << solve(0, 0, 0, 0);
  return 0;
}
