/*-----------------------------
Author : TgX.2
11Ti - K28 - CHV
-----------------------------*/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (__typeof(b) i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (__typeof(b) i = (a), _b = (b); i >= _b; i--)
#define FORC(i, a, b, c) for (__typeof(b) i = (a), _b = (b), _c = (c); i <= _b; i += _c)
#define FORSq(i, a, b) for (__typeof(b) i = (a), _b = (b); i * i <= _b; ++i)
#define FORSt(i, s) for (int i = 0, _s = (int)(s.size()); i < _s; ++i)
#define fi first
#define se second
#define pb push_back
#define len(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define _ << " " <<
#define __ << "\n"
#define ___ << " "
#define file "temp"
#define ______________TgX______________ main()
#define int long long
#define intmax 1e9
#define intmin -1e9
#define llongmax 1e18
#define llongmin -1e18
#define memo(a, val) memset((a), (val), sizeof((a)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#define arr(element_type, cnt) array<element_type, (cnt)>
#define db(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cout << endl; }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << "[ " << *it << " = " << a << " ] ";
err(++it, args...);
}
template<typename T1, typename T2> ostream& operator << (ostream& out, const pair<T1, T2>& p) {
return out << "[ " << p.first << " , " << p.second << " ] ";
}
template<class Con, class = decltype(begin(declval<Con>()))>
typename enable_if<!is_same<Con, string>::value, ostream&>::type
operator << (ostream& out, const Con& con) {
out << "{ ";
for (auto beg = con.begin(), it = beg; it != con.end(); it++) {
out << (it == beg ? "" : ", ") << *it;
}
return out << " } ";
}
template<typename T1, typename T2>
bool mini(T1 &a, T2 b)
{if (a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2>
bool maxi(T1 &a, T2 b)
{if (a < b) a = b; else return 0; return 1;}
/*-----------------------------*/
const int maxn = 1e6 + 7;
int f[maxn][3][3];
int n, m; string s;
int dp(int id, int a, int b) {
if (a < -2 or b > 2) return 0;
if (id > n) return 1;
int &ans = f[id][-a][b];
if (ans != -1) return ans;
ans = 0;
ans = (ans + dp(id + 1, min({0LL, a - 1, -1LL}), max({0LL, b - 1, -1LL}))) % m;
ans = (ans + dp(id + 1, min({0LL, a + 1, +1LL}), max({0LL, b + 1, +1LL}))) % m;
return ans;
}
void process() {
cin >> n >> m;
memo(f, -1);
int a = 0, b = 0, ans = 0;
FOR(i, 1, n) {
char x; cin >> x;
if (x == 'P'){
if (a != -2)
ans = (ans + dp(i + 1, min({0LL, a - 1, -1LL}), max({0LL, b - 1, -1LL}))) % m;
a = min({0LL, a + 1, +1LL});
b = max({0LL, b + 1, +1LL});
} else {
a = min({0LL, a - 1, -1LL});
b = max({0LL, b - 1, -1LL});
}
}
cout << ans + 1;
}
/*-----------------------------*/
______________TgX______________ {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(file".inp", "r")) {
freopen(file".inp", "r", stdin);
freopen(file".out", "w", stdout);
freopen(file".debug", "w", stderr);
}
process();
}
/*==============================+
|INPUT |
--------------------------------|
================================+
|OUTPUT |
--------------------------------|
===============================*/
