#include <bits/stdc++.h>
#define vc vector<ll>
#define um unordered_map<ll,ll>
#define ll long long
#define rep(i,a,b) for(__typeof(a) i=a; i<b; i++)
#define si(a) a.size()
#define all(a) a.begin(),a.end()
#define ss(a) a.second
#define ff(a) a.first
#define pb push_back
#define repit(i,a) for(auto i=a.begin(); i!=a.end(); i++)
#define take(arr,n) for(int i=0;i<n;i++)cin>>arr[i]
#define out(arr,n) for(int i=0;i<n;i++)cout<<arr[i]<<' '
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define reprev(i,b,a) for(__typeof(b) i=b; i>=a; i--)
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define doublearray vector<vector<int>>
#define mod 100000000000000001

using namespace std;
ll max(ll a, ll b){ return a>b?a:b; }
ll min(ll a, ll b){ return a<b?a:b; }
ll gcd(ll a, ll b){
    if(b==0) return a;
    return gcd(b,a%b);
}
ll lcm(ll a, ll b){
    return (a*b)/gcd(a,b);
}
// void dfs(vector<vector<ll>>&gp, int i, int p, vector<int>&lf){
//     if(si(gp[i])==1 && gp[i][0] == p){
//         lf[i] = 1; return;
//     }
//     else if(si(gp[i])==1){
//         lf[i] = 1;
//     }
//     rep(j,0,si(gp[i])){
//         if(gp[i][j]==p) continue;
//         else{
//             dfs(gp, gp[i][j], i, lf);
//         }
//     }
// }
int main() {
    fastio;
    int p; cin>>p;
    while(p--){
       ll x, y; cin>>x>>y;
       string s; cin>>s;
       ll u=0, d=0, r=0, l=0;
       rep(i,0,si(s)){
           if(s[i]=='L') l++;
           if(s[i]=='R') r++;
           if(s[i]=='U') u++;
           if(s[i]=='D') d++;
       }
       bool ans = true;
       if(x>=0 && r<x){
           ans = false;
       }
       else if(x<0 && l<(-x)){
           ans = false;
       }
       if(y>=0 && u<y){
           ans = false;
       }
       else if(y<0 && d<(-y)){
           ans = false;
       }
       if(ans) yes;
       else no;
    }
	return 0;
}
