#include <math.h>
#include <time.h>
#include <ctype.h>
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include<iomanip>

#define mod 1000000007 
#define ll long long int
#define pb(x) push_back(x)
#define MP(x,y) make_pair(x,y)

using namespace std;



ll power(ll a, ll b, ll m)
{
	if (b == 0)
		return(1);
	ll sol = power(a, b / 2, m);
	sol = (sol * sol) % m;
	if (b % 2 == 1)
		sol = (sol * a) % m;
	return sol;
}

ll gcd(ll a, ll b)
{
	if (b == 0)
		return a;
	else
	{
		return gcd(b, a % b);
	}
}
string s;
void solve()
{
	int px, py,l=0,r=0,u=0,d=0;
	cin >> px >> py;
	cin >> s;
	for (int i = 0;i < s.length();i++)
	{
		if (s[i] == 'L')
			l++;
		if (s[i] == 'R')
			r++;
		if (s[i] == 'U')
			u++;
		if (s[i] == 'D')
			d++;
	}
	if (px >= 0)
	{
		if (r < px)
		{
			cout << "NO\n";
			return;
		}
	}
	else
	{
		if (l < -1*px)
		{
			cout << "NO\n";
			return;
		}
	}
	if (py >= 0)
	{
		if (u < py)
		{
			cout << "NO\n";
			return;
		}
	}
	else
	{
		if (d < -1 * py)
		{
			cout << "NO\n";
			return;
		}
	}
	cout << "YES\n";
}
int main()
{
	int t = 1;
	cin >> t;
	while (t--)
	{
		solve();
	}
}