#include <bits/stdc++.h>
const int N = 1005;
int f[N][N][2], ksm[N];
int n, m, mod;
inline void read(int& x) {
  char c;
  for (c = getchar(); !isdigit(c); c = getchar())
    ;
  for (x = 0; isdigit(c); c = getchar()) x = x * 10 + c - '0';
}
inline int add(int x, int y) {
  x += y - mod;
  return x + (x >> 31 & mod);
}
inline int addm(int x, int y) {
  x += y - m;
  return x + (x >> 31 & m);
}
int main() {
  read(n);
  read(m);
  read(mod);
  f[0][0][1] = 1;
  ksm[0] = 1;
  for (int i = 1; i < N; ++i) ksm[i] = 1ll * ksm[i - 1] * 10 % m;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j)
      for (int k = i == n - 1; k <= 9; ++k) {
        int x = addm(k * ksm[i] % m, j);
        f[i + 1][x][0] = add(f[i + 1][x][0], f[i][j][0]);
        if (k && !x)
          f[i + 1][x][0] = add(f[i + 1][x][0], f[i][j][1]);
        else
          f[i + 1][x][1] = add(f[i + 1][x][1], f[i][j][1]);
      }
  int ans = 0;
  for (int i = 0; i < m; ++i) ans = add(ans, f[n][i][0]);
  printf("%d", ans);
  return 0;
}
