#include <bits/stdc++.h>
using namespace std;
long long int n, k, m;
long long int potmodk[1001];
long long int potmodm[1001];
long long int dp[1001][101][10][2];
long long int solve(long long int x, long long int y, long long int d,
                    bool onlyZeroes) {
  long long int res = 0;
  if (x == n) {
    return y == 0 and d != 0;
  }
  if (y == 0 and x > 0 and !onlyZeroes) {
    return (9 * potmodm[n - x - 1]) % m;
  }
  if (dp[x][y][d][onlyZeroes] != -1) {
    return dp[x][y][d][onlyZeroes];
  }
  for (int i = 0; i <= 9; i++) {
    res = (res + solve(x + 1, (y + ((i * potmodk[x]) % k)) % k, i,
                       (i == 0 and onlyZeroes))) %
          m;
  }
  return dp[x][y][d][onlyZeroes] = res;
}
int main() {
  scanf("%lld%lld%lld", &n, &k, &m);
  potmodk[0] = 1;
  potmodm[0] = 1;
  for (int i = 1; i < 1001; i++) {
    potmodk[i] = (potmodk[i - 1] * 10) % k;
    potmodm[i] = (potmodm[i - 1] * 10) % m;
  }
  memset(dp, -1, sizeof(dp));
  printf("%lld\n", solve(0, 0, 0, true));
  return 0;
}
