#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;
    bool f;
    string S;
    cin >> N >> M >> S;

    f=0;
    for (int i=0; i<2*(N+M); i++){
        if (S[i] == 'A') f=1;
        else if (S[i] == 'C'){
            if (!f){
                cout << "No" << endl;
                return 0;
            }
        }
    }
    f=0;
    for (int i=2*(N+M)-1; i>=0; i--){
        if (S[i] == 'A') f=1;
        else if (S[i] == 'W'){
            if (!f){
                cout << "No" << endl;
                return 0;
            }
        }
    }

    cout << "Yes" << endl;

    return 0;
}