#include <bits/stdc++.h>
using namespace std;
int n, d, mod;
int f[1111][111][2][2];
int pw10[1111];
void add(int &x, const int &y) {
  x += y;
  if (x >= mod) x -= mod;
}
void process(void) {
  cin >> n >> d >> mod;
  pw10[0] = 1;
  for (int i = (1), _b = (n); i <= _b; i = i + 1)
    pw10[i] = pw10[i - 1] * 10 % d;
  f[0][0][0][1] = 1;
  for (int dig = 0, _n = (n); dig < _n; dig = dig + 1)
    for (int cur = 0, _n = (d); cur < _n; cur = cur + 1)
      for (int ok = 0, _n = (2); ok < _n; ok = ok + 1)
        for (int ze = 0, _n = (2); ze < _n; ze = ze + 1)
          if (f[dig][cur][ok][ze] > 0)
            for (int chs = (dig == n - 1 ? 1 : 0), _b = (9); chs <= _b;
                 chs = chs + 1) {
              int nextMod = (chs * pw10[dig] + cur) % d;
              int nextZe = ze && (chs == 0);
              add(f[dig + 1][nextMod][ok || (!nextZe && nextMod == 0)][nextZe],
                  f[dig][cur][ok][ze]);
            }
  int res = 0;
  for (int cur = 0, _n = (d); cur < _n; cur = cur + 1)
    add(res, f[n][cur][1][0]);
  cout << res << endl;
}
int main(void) {
  process();
  return 0;
}
