#include <bits/stdc++.h>
using namespace std;
long long m, n, k;
long long dp[1010][110][2];
long long po[1010];
long long solve(int t, int x, int done) {
  if (t == n && done) return 1;
  if (t == n) return 0;
  if (dp[t][x][done] != -1) return dp[t][x][done];
  long long t1 = 0;
  for (int i = ((t != n - 1) ? 0 : 1); i <= 9; i++) {
    t1 += solve(t + 1, (i * po[t] + x) % k,
                done | (((i * po[t] + x) % k) == 0 && i != 0));
    t1 %= m;
  }
  return dp[t][x][done] = t1;
}
int main() {
  ios_base::sync_with_stdio(0);
  memset(dp, -1, sizeof dp);
  cin >> n >> k >> m;
  po[0] = 1;
  for (int i = 1; i <= n; i++) po[i] = po[i - 1] * 10, po[i] %= k;
  cout << solve(0, 0, 0);
  return 0;
}
