#include <bits/stdc++.h>
using namespace std;
int main() {
  long long dp[1007][107], ans, a[1007], b[1007], n, k, m, i, ost, x;
  cin >> n >> k >> m;
  a[0] = 1 % m;
  for (i = 1; i < 1007; i++) a[i] = (a[i - 1] * 10) % k;
  b[0] = 1 % m;
  b[1] = 9 % m;
  for (i = 2; i < 1007; i++) b[i] = (b[i - 1] * 10) % m;
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1 % m;
  ans = 0;
  for (i = 1; i <= n; i++) {
    for (ost = 0; ost < k; ost++) {
      for (x = 0; x < 10; x++) {
        if ((x > 0) && (((x * a[i - 1] + ost) % k) == 0))
          ans = (ans + dp[i - 1][ost] * b[n - i]) % m;
        else
          dp[i][(x * a[i - 1] + ost) % k] =
              (dp[i][(x * a[i - 1] + ost) % k] + dp[i - 1][ost]) % m;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
