#include <bits/stdc++.h>
const int MAXN = 1000, MAXK = 100;
int N, K, M, pwrM[MAXN + 5], pwrK[MAXN + 5];
int f[MAXN + 5][MAXK + 5][2];
inline int mul(const long long a, const int b) { return a * b % M; }
inline int add(int a, const int b) { return (a += b) < M ? a : a - M; }
inline int solve(const int x, const int s, const bool t) {
  if (x > N) return t && !s;
  if (t && !s) return mul(9, pwrM[N - x]);
  int& cur = f[x][s][t];
  if (~cur) return cur;
  cur = 0;
  for (int d = x == N; d <= 9; ++d) {
    cur = add(cur, solve(x + 1, (s + d * pwrK[x - 1]) % K, t || d));
  }
  return cur;
}
int main() {
  scanf("%d %d %d", &N, &K, &M);
  pwrM[0] = pwrK[0] = 1;
  for (int i = 1; i <= N; ++i) {
    pwrM[i] = mul(10, pwrM[i - 1]);
    pwrK[i] = pwrK[i - 1] * 10 % K;
  }
  memset(f, 0xff, sizeof f);
  printf("%d\n", solve(1, 0, 0));
  return 0;
}
