#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,M; string S; cin >> N >> M >> S;
  vector<int> W,A,C;
  rep(i,sz(S)){
    if(S[i]=='W') W.pb(i);
    if(S[i]=='A') A.pb(i);
    if(S[i]=='C') C.pb(i);
  }
  rep(i,N){
    int p = W[sz(W)-1-i];
    int q = A[sz(A)-1-i];
    if(p>q){
      cout << "No\n";
      return 0;
    }
  }
  rep(i,M){
    int p = A[i];
    int q = C[i];
    if(p>q){
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}