#include <bits/stdc++.h>
using namespace std;
long long int n, k, mod;
long long int dp[1005][105][2];
long long int pwm[1005], pwk[1005];
long long int calc(long long i, long long rem, bool last) {
  if (rem == 0 && last) return i == n ? 1 : (9ll * pwm[n - i - 1]) % mod;
  if (i == n || (rem == 0 && last)) return 0;
  if (dp[i][rem][last] != -1) return dp[i][rem][last];
  int res = 0;
  for (long long int d = 0; d < 10; d++)
    res = (res + calc(i + 1, (rem + d * pwk[i]) % k, last || d)) % mod;
  return dp[i][rem][last] = res;
}
int main() {
  scanf("%I64d %I64d %I64d", &n, &k, &mod);
  pwm[0] = pwk[0] = 1ll;
  for (int i = 1; i <= n; i++)
    pwm[i] = (pwm[i - 1] * 10ll) % mod, pwk[i] = (pwk[i - 1] * 10ll) % k;
  memset(dp, -1, sizeof(dp));
  printf("%I64d\n", calc(0, 0, 0));
}
