#include <bits/stdc++.h>
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
using namespace std;
long long int n, k, m;
long long int dp[1002][102][2], Fac[1003], PW[1009];
long long int solve(int pos, int md, int led) {
  if (pos == n) {
    if (!md && led) return 1;
    return 0;
  }
  long long int &res = dp[pos][md][led];
  if (res != -1) return res;
  res = 0LL;
  if (!md && led) {
    res = (Fac[n - pos - 1] * 9LL);
  } else {
    for (int i = 0; i < 10; i++) {
      res = (res + solve(pos + 1, (md + (PW[pos] * i)) % k, (i > 0))) % m;
    }
  }
  return res;
}
int main() {
  cin >> n >> k >> m;
  Fac[0] = 1LL % m;
  PW[0] = 1;
  long long int now = 1 % k;
  for (int i = 1; i < n + 1; i++) {
    Fac[i] = (Fac[i - 1] * 10) % m;
    now *= 10;
    now %= k;
    PW[i] = now;
  }
  memset(dp, -1, sizeof(dp));
  cout << solve(0, 0, 0) % m << endl;
  return 0;
}
