//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
//endfold
#define N (1'000'005)
#define MOD (1000000000l + 7l)
#define OO (1050000000)
#define OOL (1100000000000000000)
//global
int n,m;
int dp[5][5][N];
int ans(int ml,int mp,int i){
if(i == n) return 1;
if(dp[ml][mp][i] != -1) return dp[ml][mp][i];
dp[ml][mp][i] = 0;
int ml1 = ml+1,mp1 = max(0,mp-1);
int ml2 = max(0,ml-1),mp2 = mp+1;
if(ml1 < 3 && mp1 < 3) dp[ml][mp][i] += ans(ml1,mp1,i+1);
if(ml2 < 3 && mp2 < 3) dp[ml][mp][i] += ans(ml2,mp2,i+1);
if(dp[ml][mp][i] > m) dp[ml][mp][i] -= m;
return dp[ml][mp][i];
}
int main(){
//fold
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cout << setprecision(10);
//endfold
memset(dp,-1,sizeof dp);
string s;
cin >> n >> m >> s;
int bef = 0;
int ml = 0,mp = 0;
rep(i,0,n){
if(s[i] == 'P'){
int ml1 = ml+1,mp1 = max(0,mp-1);
if(ml1 < 3 && mp1 < 3) bef += ans(ml1,mp1,i+1);
ml = max(0,ml-1);
mp++;
}else{
ml++;
mp = max(0,mp-1);
}
if(bef > m) bef -= m;
}
cout << (bef+1)%m;
return 0;
}
