#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int inf = (int)1e9;
int n, k, m;
vector<vector<unsigned long long int> > dp(1005,
                                           vector<unsigned long long int>(105));
int main() {
  cin >> n >> k >> m;
  for (int i = 1; i < 10; ++i) {
    dp[1][i % k]++;
    dp[1][i % k] %= m;
  }
  unsigned long long int st = 10 % k;
  for (int i = 1; i < n; ++i) {
    for (int j = 1; j < k; ++j) {
      dp[i][j] = (dp[i][j] + dp[i - 1][j]) % m;
    }
    for (int j = 1; j < k; ++j) {
      for (int x = 1; x < 10; ++x) {
        unsigned long long int now = (st * x + j) % k;
        dp[i + 1][now] = (dp[i + 1][now] + dp[i][j]) % m;
      }
    }
    for (int x = 1; x < 10; ++x) {
      unsigned long long int now = (st * x + 0) % k;
      dp[i + 1][now] = (dp[i + 1][now] + 1) % m;
    }
    st = (st * 10) % k;
  }
  unsigned long long int ans = dp[n][0];
  st = 1;
  for (int i = n - 1; i >= 1; --i) {
    ans = (ans + 9ll * st * dp[i][0]) % m;
    st = (st * 10) % m;
  }
  cout << ans;
  return 0;
}
