#include <bits/stdc++.h>
    using namespace std;
    #include <ext/pb_ds/assoc_container.hpp>
    using namespace __gnu_pbds;
    
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)

    typedef long long ll;
    typedef unsigned long long ull;
    typedef long double ld;
    using P=pair<ll,ll>;
    using tp=tuple<ll,ll,ll>;
    const int INF=1001001001; 
    const ll INFL=1e18;
    const ll mod=998244353;
    
    void solve(){
        int n,m;
        string s;
        cin>>n>>m>>s;
        int N=2*(n+m);
        deque<int>t;
        for(int i=N-1;i>=0;i--){
            if(s[i]=='A')t.push_front(i);
            else if(s[i]=='W'){
                if(t.empty()){
                    cout<<"No"<<endl;
                    return;
                }
                t.pop_back();
            }
        }
        for(int i=0;i<N;i++){
            if(s[i]=='C'){
                if(t.empty()||t.front()>i){
                    cout<<"No"<<endl;
                    return;
                }
                t.pop_front();
            }
        }
        cout<<"Yes"<<endl;
    }

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();
        
        return 0;
    }