#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
const int MAXN = 1005, MAXK = 105;
long long pow10k[MAXN], pow10m[MAXN];
long long dp[MAXN][MAXK][2];
int n, k, m;
long long solve(int idx, int left, int zero) {
  if (left == 0 && !zero) {
    int prefix_len = n - idx;
    return prefix_len == 0 ? 1 : 9LL * pow10m[prefix_len - 1] % m;
  } else if (idx >= n)
    return 0;
  else if (dp[idx][left][zero] != -1)
    return dp[idx][left][zero];
  long long res = 0;
  for (int i = 0; i < 10; i++) {
    long long add = pow10k[idx] * i % k;
    long long nleft = (add + left) % k;
    res = (res + solve(idx + 1, nleft, i == 0)) % m;
  }
  return dp[idx][left][zero] = res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k >> m;
  pow10k[0] = 1, pow10m[0] = 1;
  for (int i = 1; i <= n; i++) {
    pow10k[i] = (pow10k[i - 1] * 10) % k;
    pow10m[i] = (pow10m[i - 1] * 10) % m;
  }
  memset(dp, -1, sizeof dp);
  cout << solve(0, 0, 1);
}
