#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M, l, K, cnt=0;
    string S;
    cin >> N >> M >> S;
    K = (N+M)*2;
    string T="", U="";

    for (int i=0; i<K; i++){
        if (S[i] == 'A' && cnt < M){
            T += '(';
            cnt++;
        }
        else if (S[i] == 'C') T += ')';
    }

    reverse(S.begin(), S.end());
    cnt = 0;
    for (int i=0; i<K; i++){
        if (S[i] == 'A' && cnt < N){
            U += ')';
            cnt++;
        }
        else if (S[i] == 'W') U += '(';
    }
    reverse(U.begin(), U.end());

    l = 0;
    for (int i=0; i<M*2; i++){
        if (T[i] == '(') l++;
        else l--;
        if (l < 0){
            cout << "No" << endl;
            return 0;
        }
    }
    l = 0;
    for (int i=0; i<N*2; i++){
        if (U[i] == '(') l++;
        else l--;
        if (l < 0){
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;

    return 0;
}