#include <bits/stdc++.h>
using namespace std;
int n, k, m;
long long int dp[1005][105][2];
long long int kpo[1005], mpo[1005];
void pre() {
  kpo[0] = mpo[0] = 1;
  for (int i = 1; i <= 1001; i++) {
    kpo[i] = (10 * kpo[i - 1]) % k;
    mpo[i] = (10 * mpo[i - 1]) % m;
  }
}
long long int f(int pos, int mmod, int flag) {
  if (mmod == 0 && flag) {
    if (pos == n)
      return 1;
    else
      return (9 * mpo[n - pos - 1]) % m;
  }
  if (pos == n) return 0;
  long long int &ret = dp[pos][mmod][flag];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = 0; i < 10; i++) {
    ret += 1LL * f(pos + 1, (mmod + i * kpo[pos]) % k, flag | (i != 0)) % m;
    ret %= m;
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k >> m;
  pre();
  memset(dp, -1, sizeof(dp));
  int ans = f(0, 0, 0);
  cout << ans;
  return 0;
}
