#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
struct req{
    int x,y,k;
    char c;
};
int arr[505][505];
req r[250005];
int h,w,n,x,y,k,rc;
char c;
int main(){
    scanf("%d%d%d",&h,&w,&n);
    while(scanf(" %d %d %d %c",&x,&y,&k,&c) != EOF){
        for(int i = 0; i < k;++i){
            int xp=x+(c=='R')*i-(c=='L')*i,yp=x-(c=='U')*i+(c=='D')*i;
            //printf("%d %d %c\n",xp, yp, c);
            arr[xp][yp]++;
        }
        r[rc++]={x,y,k,c};
    }
    int flag = 0;
    for(int i = 0; i < rc; ++i){
        int xpe=x+(r[i].c=='R')*k-(r[i].c=='L')*k,ype=x-(r[i].c=='U')*k+(r[i].c=='D')*k;
        if(arr[xpe][ype] == 2 && arr[xpe][ype] == 2) {flag=1;break;}
        if(arr[xpe][ype] > 2 || arr[xpe][ype] > 2) {flag=1;break;}
        for(int j = 1;j<r[i].k-1;++j){
            int xp=x+(r[i].c=='R')*j-(r[i].c=='L')*j,yp=x-(r[i].c=='U')*j+(r[i].c=='D')*j;
            if(arr[xp][yp]>1){
                flag = 1;
                break;
            }
        }
    }

    if(!flag)printf("Yes\n");
    else printf("No\n");
    return 0;
}