#include <bits/stdc++.h>
using namespace std;
;
const int maxn = 2e5 + 5;
const int mod = 998244353;
int dp[1005][105][2][2], p[1005];
int n, k, m;
int cal(int pos, int mod, bool pre, bool zero) {
  if (zero == 0) pre = 0;
  if (pos == n) return pre;
  int& res = dp[pos][mod][pre][zero];
  if (res != -1) return res;
  res = 0;
  for (int i = (pos == n - 1); i < 10; ++i) {
    int newmod = (mod + p[pos] * i) % k;
    res += cal(pos + 1, newmod, pre | (!newmod), zero |= i);
    if (res >= m) res -= m;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> m;
  memset(dp, -1, sizeof dp);
  p[0] = 1;
  for (int i = 1; i <= 1000; ++i) p[i] = p[i - 1] * 10 % k;
  cout << cal(0, 0, 0, 0);
}
