#include <cstdio>

#include <cstring>

const int maxn = 1000000005, maxm = 25;

int n, m, p, mtx[maxm][maxm], trie[maxm][10], fail[maxm], trans[maxm][maxm], tem[maxm][maxm], ans;

char unf[maxm];

inline void mul(int aa[maxm][maxm], int ss[maxm][maxm]) {

	memset((void*)tem, 0, sizeof tem);

	for (int i = 0; i < m; ++i) {

		for (int j = 0; j < m; ++j) {

			for (int k = 0; k < m; ++k) {

				tem[i][j] = (tem[i][j] + aa[i][k] * ss[k][j]) % p;

			}

		}

	}

	memcpy((void*)aa, (void*)tem, sizeof tem);

}

inline void poww(int mi) {

	int i;

	for (i = 31; mi >> i & 1 ^ 1; --i);

	memcpy((void*)trans, (void*)mtx, sizeof mtx);

	for (--i; ~i; --i) {

		mul(trans, trans);

		if (mi >> i & 1) {

			mul(trans, mtx);

		}

	}

}

int main(void) {

	//freopen("in.txt", "r", stdin);

	scanf("%d%d%d", &n, &m, &p);

	scanf("%s", unf + 1);

	for (int i = 0; i < m; ++i) {

		trie[i][unf[i + 1] - '0'] = i + 1;

	}

	for (int i = 1; i <= m; ++i) {

		for (int j = 0; j < 10; ++j) {

			if (trie[i][j]) {

				fail[trie[i][j]] = trie[fail[i]][j];

			}

			else {

				trie[i][j] = trie[fail[i]][j];

			}

		}

	}

	for (int i = 0; i < m; ++i) {

		for (int j = 0; j < 10; ++j) {

			++mtx[i][trie[i][j]];

		}

	}

	poww(n);

	for (int i = 0; i < m; ++i) {

		ans = (ans + trans[0][i]) % p;

	}

	printf("%d\n", ans);

	return 0;

}