#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int N = 1e9 + 9;
const long long M = 2e18;
int n, mod, m, mp, ten[1002];
long long dp[1002][101][2][2], MOD;
long long moding(long long x, long long mod) {
  if (x >= mod) x %= mod;
  return x;
}
long long slv(int i = 0, int c = 0, bool z = 0, bool val = 0) {
  if (i == n) return val;
  long long& ret = dp[i][c][z][val];
  if (~ret) return ret;
  ret = 0;
  for (int j = (i == n - 1); j <= 9; j++) {
    int tmp = moding(c + moding(j * ten[i], mod), mod);
    if (j > 0) z = 1;
    ret = moding(ret + slv(i + 1, tmp, z, val | (tmp == 0 && z)), MOD);
  }
  return ret;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> mod >> m;
  MOD = m;
  while (MOD < N) MOD *= 10;
  ten[0] = 1;
  for (int i = 1; i < n; i++) ten[i] = moding(ten[i - 1] * 10, mod);
  cout << moding(slv(), m);
  return 0;
}
