#include<bits/stdc++.h>
#define str string
#define task "strdel"
#define int long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=1e6+5,lg=20;
int mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int n,f[2][5][5][5][2],k,a[N];
string s;
// int cc(int i,int cnt,int maxx,int minn,bool ok){
// // cout <<i<<" "<<cnt<<" "<<maxx<<" "<<minn<<'\n';
// if(i>n)return 1;
// if(f[i][cnt][maxx][minn]!=-1)return f[i][cnt][maxx][minn];
// int ans=0;
// int cnt1=cnt+1;
// int maxx1=max(maxx,cnt1);
// int minn1=min(minn,cnt1);
// if(maxx1-minn1<=2&&(ok||a[i]>=1))ans=(ans+cc(i+1,cnt1,maxx1,minn1,ok||a[i]>1))%mod;
// cnt1=cnt-1;
// maxx1=max(maxx,cnt1);
// minn1=min(minn,cnt1);
// if(maxx1-minn1<=2)ans=(ans+cc(i+1,cnt1,maxx1,minn1,ok||a[i]>0))%mod;
// if(ok)f[i][cnt][maxx][minn]=ans;
// return ans;
// }
void add(int &a,int b){
a+=b;
if(a>mod)a-=mod;
}
bool sf(int i){
return i&1;
}
void solve(){
cin >> n >> mod >> s;
s=" "+s;
for(int i=1;i<=n;++i){
a[i]=(s[i]=='P');
}
f[0][2][2][2][0]=1;
for(int i=0;i<n;++i){
memset(f[sf(i+1)],0,sizeof f[sf(i+1)]);
for(int cnt=0;cnt<=4;++cnt){
for(int maxx=2;maxx<=4;++maxx){
for(int minn=0;minn<=2;++minn){
for(int ok=0;ok<=1;++ok)
{
int cnt1=cnt+1;
int maxx1=max(maxx,cnt1);
int minn1=min(minn,cnt1);
if(maxx1-minn1<=2&&(ok||a[i+1]>=1))
add(f[sf(i+1)][cnt1][maxx1][minn1][ok||a[i+1]>1],f[sf(i)][cnt][maxx][minn][ok]);
cnt1=cnt-1;
maxx1=max(maxx,cnt1);
minn1=min(minn,cnt1);
if(maxx1-minn1<=2&&(ok||a[i+1]>=0))
add(f[sf(i+1)][cnt1][maxx1][minn1][ok||a[i+1]>0],f[sf(i)][cnt][maxx][minn][ok]);
}
}
}
}
}
int ans=0;
for(int cnt=0;cnt<=4;++cnt){
for(int maxx=2;maxx<=4;++maxx){
for(int minn=0;minn<=2;++minn){
for(int ok=0;ok<=1;++ok)
if(maxx-minn<=2)add(ans,f[sf(n)][cnt][maxx][minn][ok]);
}
}
}
cout <<ans;
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
cout<<'\n';
}
}
