#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:134217728")
using namespace std;
int dp[1 << 10][1 << 7][2][2];
int pw[1 << 10];
int main() {
  int n, k, m;
  cin >> n >> k >> m;
  dp[0][0][0][0] = 1 % m;
  pw[0] = 1 % k;
  for (int i = 1; i < 1 << 10; ++i) pw[i] = pw[i - 1] * 10 % k;
  for (int i = 0; i < n; ++i) {
    for (int r = 0; r < k; ++r) {
      for (int j = 0; j < 2; ++j) {
        for (int jj = 0; jj < 2; ++jj) {
          for (int d = 0; d <= 9; ++d) {
            if (d == 0 && i == n - 1) continue;
            int rr = (r + pw[i] * d) % k;
            int too = (d > 0) | jj;
            int to = too & (rr == 0) | j;
            dp[i + 1][rr][to][too] += dp[i][r][j][jj];
            if (dp[i + 1][rr][to][too] >= m) dp[i + 1][rr][to][too] -= m;
          }
        }
      }
    }
  }
  int res = 0;
  for (int i = 0; i < k; ++i) {
    res += dp[n][i][1][1];
    if (res >= m) res -= m;
  }
  cout << res << endl;
  return 0;
}
