#include <bits/stdc++.h>

using namespace std;

const int N = 400010;
char s[N];
bool used[N];

int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    scanf("%s", s);
    deque<int> a;
    int all = n + n + m + m;
    for (int i = 0; i < all; i++)
    {
        if (s[i] == 'A') a.push_back(i);
    }
    bool ok = true;
    int i = 0, j = all - 1;
    while (ok && i <= j)
    {
        char left = s[i];
        char right = s[j];
        if (left == 'C')
        {
            int p = a.front();
            ok &= p < i;
            a.pop_front();
        }
        else if (left == 'W')
        {
            int p = a.back();
            ok &= i < p;
            a.pop_back();
        }

        if (i != j)
        {
            if (right == 'W')
            {
                int p = a.back();
                ok &= j < p;
                a.pop_back();
            }
            else if (right == 'C')
            {
                int p = a.front();
                ok &= p < j;
                a.pop_front();
            }
        }
        i++;
        j--;
    }

    if (ok)
        printf("Yes\n");
    else
        printf("No\n");

    return 0;
}