#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N,M;
    cin>>N>>M;
    string S;
    cin>>S;
    string T="AWC";
    vector<vector<int>> p(3,vector<int>(2));
    auto q=p;
    rep(i,0,(N+M)*2){
        rep(j,0,3){
            if(S[i]==T[j]){
                p[j][i&1]++;
            }
        }
    }
    bool ok=1;
    rep(i,0,N*2+M*2-1){
        if(S[i]=='W'&&S[i+1]=='C') ok=0;
    }
    rep(i,0,(N+M)*2){
        int s=i&1;
        if(S[i]=='A'){
            q[0][s]++;
        }
        if(S[i]=='W'){
            if(p[1][s]-q[1][s]>p[0][s^1]-q[0][s^1]) ok=0;
            q[1][s]++;
        }
        if(S[i]=='C'){
            q[2][s]++;
            if(q[0][s^1]<q[2][s]) ok=0;
        }
    }
    yneos(ok);
}