#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000 + 5, MOD = 1e5 + 7;
long long int dp[MAX][105], pm[MAX], pk[MAX];
int main() {
  int n;
  long long int m, k;
  scanf("%d %lld %lld", &n, &k, &m);
  pm[0] = 1LL % m, pk[0] = 1LL % k;
  for (int i = 1; i < MAX; i++) {
    pm[i] = (pm[i - 1] * 10) % m;
    pk[i] = (pk[i - 1] * 10) % k;
  }
  for (int i = 1; i < 10; i++) dp[1][i % k] = (dp[1][i % k] + 1) % m;
  for (int i = 2; i <= n; i++) {
    for (int j = 1; j < k; j++) {
      for (int x = 0; x < 10; x++) {
        if (i == n && !x) continue;
        int t = ((x * pk[i - 1]) % k + j) % k;
        dp[i][t] = (dp[i][t] + dp[i - 1][j]) % m;
      }
    }
    for (int x = 1; x < 10; x++) {
      int t = (x * pk[i - 1]) % k;
      dp[i][t] = (dp[i][t] + 1) % m;
    }
  }
  long long int ans = 0;
  for (int i = 1; i < n; i++)
    ans = (ans + (9 * pm[n - i - 1] * dp[i][0]) % m) % m;
  ans = (ans + dp[n][0]) % m;
  printf("%lld\n", ans);
  return 0;
}
