#include <cstdio>

 #include <cstdlib>

 #include <cstring>

 #include <string>

 #include <algorithm>

 using namespace std;

 #define REP(i, a, b) for (int i = (a), i##_end_ = (b); i <= i##_end_; ++i)

 #define mset(a, b) memset(a, b, sizeof(a))

 const int maxn = ;

 int n, m, MOD;

 char s[maxn];

 int nxt[maxn];

 struct Matrix

 {

     int mat[maxn][maxn];

     Matrix() { mset(mat, ); }

     Matrix operator * (const Matrix &AI) const

     {

         Matrix ret;

         REP(i, , m-)

             REP(j, , m-)

             {

                 ret.mat[i][j] = ;

                 REP(k, , m-) (ret.mat[i][j] += mat[i][k]*AI.mat[k][j]) %= MOD;

             }

         return ret;

     }

 }A, B;

 int main()

 {

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

     scanf("%s", s+);

     int j = ; nxt[] = ;

     REP(i, , m)

     {

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

         if (s[j+] == s[i]) j ++;

         nxt[i] = j;

     }

     REP(i, , m-)

         REP(j, , )

         {

             int t = i;

             while (t >  && s[t+]-'' != j) t = nxt[t];

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

             if (t != m) B.mat[t][i] = (B.mat[t][i]+)%MOD;

         }

     REP(i, , m-) A.mat[i][i] = ;

     while (n > )

     {

         if (n&) A = A*B;

         B = B*B;

         n >>= ;

     }

     int ans = ;

     REP(i, , m-) ans = (ans+A.mat[i][])%MOD;

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

     return ;

 }