#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
void ng(){
  cout << "No\n";
  exit(0);
}
int main(){
  int n,m;
  string s;
  cin >> n >> m >> s;
  vi pos;
  rep(i, (n+m)*2) if(s[i] == 'A') pos.push_back(i);
  int p = 0;
  rep(i, (n+m)*2) if(s[i] == 'C'){
    if(pos[p] > i) ng();
    p++;
  }
  p = (int)pos.size() - 1;
  rep(i, (n+m)*2) if(s[i] == 'W'){
    if(pos[p] < i) ng();
    p--;
  }
  cout << "Yes\n";
}