#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ss second
#define ff first
#define pb push_back
#define pii pair<int, int>
#define INF INT_MAX
#define debug(n) cout << #n << " = " << n << "\n";
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

const ll MOD = 1e9 + 7;

void solve() {
    int n, m, u = 0, r = 0, l = 0, d = 0;
    string s;
    cin >> n >> m >> s;
    for(char c : s) {
        if(c == 'U') u++;
        if(c == 'L') l++;
        if(c == 'R') r++;
        if(c == 'D') d++;
    }
    // cout << l << " " << r << " " << u << " " << d << "\n";
    int cnt = 0;
    if(n <= 0 && -l <= n) cnt++;
    else if(r >= n && n >= 0) cnt++;

    if(m <= 0 && -d <= m) cnt++;
    else if(u >= m && m >= 0) cnt++;

    if(cnt >= 2) cout << "YES\n";
    else cout << "NO\n";

}

int main() {
    int t ;
    cin >> t;
    while(t--) {
        solve();
    }


    return 0;
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/