#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
long n, m, k;
long dp[1001][101][2][2];
long powk[1001];
long rec(int t, int modulo, int l, int f) {
  long& res = dp[t][modulo][l][f];
  if (res != -1) return res;
  if (t == 0) return (l != 0 && f == 1) || (modulo == 0 && l != 0);
  res = 0;
  if (modulo == 0 && l != 0) f = 1;
  for (int i = 0; i <= 9; ++i) {
    res = (res +
           rec(t - 1, ((long long)i * powk[n - t] + modulo) % k, (i != 0), f)) %
          m;
  }
  return res;
}
int main() {
  cin >> n >> k >> m;
  powk[0] = 1;
  for (int i = 1; i <= 1000; ++i) {
    powk[i] = (powk[i - 1] * 10) % k;
  }
  memset(dp, -1, sizeof(dp));
  long res = rec(n, 0, 0, 0);
  cout << res << endl;
  return 0;
}
