#include using namespace std; #if __has_include() #include using namespace atcoder; typedef modint998244353 mint; #endif typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const long long LINF = 1e18; const int MOD = 998244353; const int MOD1 = 1e9+7; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define all(x) x.begin(), x.end() template bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} template bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} void yorn(bool ans){cout << (ans?"Yes":"No") << endl; return;} // しばらくはsize_tをキャストに任せてみようかな int main(){ int n,m; cin >> n >> m; string s; cin >> s; int l = (n+m)*2; /*vector w(l),c(l),a1(l),a2(l); if(s.at(0)=='C'||s.back()=='W'){cout << "No" << endl; return 0;} if(s.at(0)=='A') a1.at(0) = 1; if(s.back()=='A') a2.at(0) = 1; for(int i=1;i=0;i--){ if(s.at(i)=='W') w.at(i)++; w.at(i) += w.at(i+1); if(s.at(i) =='A') a2.at(i)++; a2.at(i) += a2.at(i+1); } rep(i,l) cout << a1.at(i) << ' '; cout << endl; rep(i,l) cout << c.at(i) << ' '; cout << endl; rep(i,l) cout << a2.at(i) << ' '; cout << endl; rep(i,l) cout << w.at(i) << ' '; cout << endl; rep(i,l){ if(a1.at(i)-c.at(i)<0 || a2.at(i)-w.at(i)<0){ cout << "No" << endl; return 0; } } cout << "Yes" << endl;*/ set a,w,c; rep(i,l){ if(s.at(i)=='A') a.insert(i); if(s.at(i)=='W') w.insert(i); if(s.at(i)=='C') c.insert(i); } //bool ans = true; for(auto i:c){ if(*begin(a)