#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define up upper_bound
#define sz(h) (int)h.size()
#define all(h) h.begin(), h.end()
#define mod 1000000007
#define mod1 998244353
#define MAX 2000010
#define cas(t) cout << "Case #" << t << ": ";
struct hash_pair
{ // use pair as key in unordered_map<pair<int,int>,int,hash_pair>;

    template <class T1, class T2>

    size_t operator()(const pair<T1, T2> &p) const

    {

        auto hash1 = hash<T1>{}(p.first);

        auto hash2 = hash<T2>{}(p.second);

        return hash1 ^ hash2;
    }
};
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
#ifndef ONLINE_JUDGE
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //freopen("input.txt", "w", stdout);
#endif
    int tt = 1;
    cin >> tt;
    for (int t = 1; t <= tt; t++)
    {
        int a, b;
        cin >> a >> b;
        int u = 0;
        int down = 0;
        int left = 0;
        int right = 0;
        string s;
        cin >> s;
        for (auto i : s)
        {
            if (i == 'U')
                u++;
            if (i == 'D')
                down++;
            if (i == 'L')
                left++;
            if (i == 'R')
                right++;
        }
        int fxl = -down;
        int fxu = u;
        int fyu = right;
        int fyl = -left;
        if (a <= fyu and fyl <= a and b <= fxu and b >= fxl)
            cout << "YES\n";
        else
            cout << "NO\n";
    }
}
