#include <bits/stdc++.h>
using namespace std;
long long bas[1005];
long long n, k, m;
long long dp[1005][105][2];
void init() {
  bas[1] = 1;
  for (int i = 2; i <= 1000; i++) {
    bas[i] = (bas[i - 1] * 10LL) % k;
  }
}
int main() {
  while (~scanf("%I64d%I64d%I64d", &n, &k, &m)) {
    init();
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < k; j++) {
        for (int d = (i == n); d < 10; d++) {
          long long mmod = (j + d * bas[i]) % k;
          if (d != 0 && mmod == 0) {
            dp[i][mmod][1] = (dp[i][mmod][1] + dp[i - 1][j][0]) % m;
          } else {
            dp[i][mmod][0] = (dp[i][mmod][0] + dp[i - 1][j][0]) % m;
          }
          dp[i][mmod][1] = (dp[i][mmod][1] + dp[i - 1][j][1]) % m;
        }
      }
    }
    long long ans = 0;
    for (int i = 0; i < k; i++) {
      ans = (ans + dp[n][i][1]) % m;
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
