#include <bits/stdc++.h>

using namespace std;

int n, m, mod;

char s[];

int fail[];

struct node {

    int c[][];

}a, re;

node mul(node x, node y) {

    node res;

    memset(res.c, , sizeof(res.c));

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

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

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

        res.c[i][j] = (res.c[i][j] + x.c[i][k] * y.c[k][j] % mod) % mod;

    return res;

}

node pow_mod(node x, int y) {

    node res;

    memset(res.c, , sizeof(res.c));

    for(int i = ; i < m; i++) res.c[i][i] = ;

    while(y) {

        if(y & ) res = mul(res, x);

        x = mul(x, x);

        y >>= ;

    }

    return res;

}

int main() {

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

    scanf("%s", s + );

    fail[] = fail[] = ;

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

        int j = fail[i - ];

        while(j && s[i] != s[j + ]) j = fail[j];

        fail[i] = s[i] == s[j + ] ? j +  : ;

    }

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

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

            int k = i;

            while(k && (s[k + ] - '') != j) k = fail[k];

            if(s[k + ] - '' == j) k++;

            if(k != m) a.c[i][k] = (a.c[i][k] + ) % mod;

        }

    }

    re = pow_mod(a, n);

    int ans = ;

    for(int i = ; i < m; i++) ans = (ans + re.c[][i]) % mod;

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

    return ;

}