#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
int main() {
    int n,m; cin >>  n>> m;
    string s; cin >> s;
    // counts are good
    // need to divide into subsequences.
    // C is important need to save a's for it, pick first A?
    queue<int> q;
    for(int i=0;i<s.size();++i) {
        if(s[i]=='A') q.push(i);
        else if(s[i]=='C') {
            if(q.empty()) {
                cout << "No\n";
                exit(0);
            }
            q.pop();
        }
    }
    vector<bool> left(s.size());
    while(!q.empty()) {
        left[q.front()]=1;
        q.pop();
    }
    int p=0;
    for(int i=0;i<s.size();++i) {
        if(left[i]) --p;
        else if(s[i]=='W') ++p;
        if(p<0) {
            cout << "No\n";
            exit(0);
        }
    }
    cout << "Yes\n";
}