#include <bits/stdc++.h>
using namespace std;
long long d[1005][1005], F, E, n, m, x, y, z, k, po = 1, ans, O = 10;
int main() {
  cin >> n >> k >> m;
  for (int i = 1; i <= 9; i++) d[1][i % k]++, d[1][i % k] %= m;
  for (int i = 1; i < n; i++) {
    po *= 10;
    po %= k;
    for (int j = 1; j < k; j++) {
      for (int e = 0; e <= 9; e++)
        d[i + 1][(e * po + j) % k] = (d[i + 1][(e * po + j) % k] + d[i][j]) % m;
    }
    for (int j = 1; j <= 9; j++)
      d[i + 1][(j * O) % k]++, d[i + 1][(j * O) % k] %= m;
    O = (O * 10) % k;
  }
  x = 9;
  ans = d[n][0];
  for (int i = n - 1; i >= 1; i--) {
    ans = (ans + d[i][0] * x) % m;
    x *= 10;
    x %= m;
  }
  cout << ans << endl;
  cin >> n;
}
