#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, m, k;
int d[2][N][105];
int p[N];
int ans = 0;
void add(int &x, int y) {
  if ((x += y) >= m) x -= m;
}
int main() {
  scanf("%d%d%d", &n, &k, &m);
  p[0] = 1;
  for (int i = 1; i <= n; ++i) p[i] = p[i - 1] * 10 % k;
  d[0][0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int cur = (i == n); cur <= 9; ++cur) {
      for (int rem = 0; rem < k; ++rem) {
        int CurRem = (rem + p[i - 1] * cur) % k;
        add(d[1][i][CurRem], d[1][i - 1][rem]);
        if (CurRem == 0 && cur)
          add(d[1][i][CurRem], d[0][i - 1][rem]);
        else
          add(d[0][i][CurRem], d[0][i - 1][rem]);
      }
    }
  }
  for (int i = 0; i < k; ++i) ans = (ans + d[1][n][i]) % m;
  printf("%d\n", ans);
  return 0;
}
