#include <bits/stdc++.h>
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
int ext_gcd(int a, int b, int& x, int& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int x1, y1;
  int d = ext_gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
inline long long modInv(int a, int m) {
  int x, y;
  ext_gcd(a, m, x, y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
int n, k, m;
long long tenPow[1010];
void calculate() {
  tenPow[0] = 1 % k;
  for (int i = (1); i <= (1005); ++i) {
    tenPow[i] = (tenPow[i - 1] * 10) % k;
  }
}
long long zoro[1003][103][2];
int sword[1003][103][2], cc = 1;
long long suf(int pos, int rem, int flag) {
  if (pos == 0) {
    if (rem == 0)
      return 1;
    else
      return 0;
  }
  if (sword[pos][rem][flag] == cc) return zoro[pos][rem][flag];
  int start = 0;
  if (flag == 0) start++;
  long long res = 0;
  for (int i = (start); i <= (9); ++i) {
    res += suf(pos - 1, ((rem + tenPow[pos - 1] * i) % k), 1);
  }
  res %= m;
  sword[pos][rem][flag] = cc;
  return zoro[pos][rem][flag] = res;
}
long long nami[1003][103][2];
int compass[1003][103][2], dd = 1;
long long pref(int pos, int rem, int flag) {
  if (flag && rem == 0) return 0;
  if (pos == n + 1) {
    return 1;
  }
  if (compass[pos][rem][flag] == dd) return nami[pos][rem][flag];
  int start = 0;
  if (pos == n) start++;
  long long res = 0;
  int nf = 0;
  for (int i = (start); i <= (9); ++i) {
    if (i) nf = 1;
    res += pref(pos + 1, (rem + tenPow[pos - 1] * i) % k, nf);
  }
  res %= m;
  compass[pos][rem][flag] = dd;
  return nami[pos][rem][flag] = res;
}
int main() {
  scanf("%d %d %d", &n, &k, &m);
  calculate();
  long long res = 0;
  for (int i = (1); i <= (n); ++i) {
    long long x = suf(i, 0, 0);
    long long y = pref(i + 1, 0, 0);
    long long z = (x * y) % m;
    res = (res + z) % m;
  }
  printf("%I64d\n", res);
  return 0;
}
