#include <bits/stdc++.h>
using namespace std;
int n, k, m;
int d[2000][105][2];
int t[2000];
int ans;
int main() {
  cin >> n >> k >> m;
  t[0] = 1;
  for (int i = 1; i <= n; i++) t[i] = t[i - 1] * 10 % k;
  for (int i = 0; i < 10; i++)
    d[1][i % k][(i > 0 && i % k == 0 ? 1 : 0)] =
        (d[1][i % k][(i > 0 && i % k == 0 ? 1 : 0)] + 1) % m;
  for (int i = 2; i <= n; i++) {
    for (int last = (i == n); last < 10; last++) {
      for (int j = 0; j < k; j++) {
        int now = (last * t[i - 1] + j) % k;
        if (last > 0 && now == 0)
          d[i][now][1] = (d[i][now][1] + d[i - 1][j][0]) % m;
        else
          d[i][now][0] = (d[i][now][0] + d[i - 1][j][0]) % m;
        d[i][now][1] = (d[i][now][1] + d[i - 1][j][1]) % m;
      }
    }
  }
  for (int i = 0; i < k; i++) ans = (ans + d[n][i][1]) % m;
  cout << ans;
  return 0;
}
