#include <bits/stdc++.h>
using namespace std;
int n, k, m, f[1001][101][2];
int main() {
  scanf("%d%d%d", &n, &k, &m);
  memset(f, 0, sizeof(f));
  for (int i = 1; i <= 9; i++) f[1][i % k][0]++, f[1][i % k][0] %= m;
  int ans = 0, shy = 1;
  for (int i = 2; i <= n; i++) {
    shy *= 10;
    shy %= k;
    for (int j = 1; j <= 9; j++)
      f[i][shy * j % k][0]++, f[i][shy * j % k][0] %= m;
    for (int j = 0; j < k; j++) {
      if (j == 0)
        for (int l = 0; l < 10; l++)
          f[i][0][l == 0] += (f[i - 1][j][0] + f[i - 1][j][1]) % m,
              f[i][0][l == 0] %= m;
      else
        for (int l = 0; l < 10; l++)
          f[i][(j + l * shy) % k][l == 0] +=
              (f[i - 1][j][0] + f[i - 1][j][1]) % m,
              f[i][(j + l * shy) % k][l == 0] %= m;
    }
  }
  printf("%d\n", f[n][0][0]);
}
