/* Problem URL: https://codeforces.com/problemset/problem/2030/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        int n, q;
        cin >> n >> q;

        vi perm(n);
        cin >> perm;

        string a;
        cin >> a;

        repv(i, a) {
            i = i == 'R';
        }

        vi ma(n);
        vi mi(n);

        ma[0] = perm[0];
        mi[n - 1] = perm[n - 1];

        nrep(i, 1, n) {
            ma[i] = max(ma[i - 1], perm[i]);
            mi[n - i - 1] = min(mi[n - i], perm[n - i - 1]);
        }

        int bad = 0;
        rep(i, n - 1) {
            if (a[i] == 0 && a[i + 1] == 1) {
                bad += ma[i] > mi[i + 1];
            }
        }

        while (q--) {
            int i;
            cin >> i;
            i--;

            if (a[i] == 1 && a[i - 1] == 0) {
                bad -= ma[i - 1] > mi[i];
            }

            if (a[i] == 0 && a[i + 1] == 1) {
                bad -= ma[i] > mi[i + 1];
            }

            a[i] ^= 1;

            if (a[i] == 1 && a[i - 1] == 0) {
                bad += ma[i - 1] > mi[i];
            }

            if (a[i] == 0 && a[i + 1] == 1) {
                bad += ma[i] > mi[i + 1];
            }

            cout << (bad == 0 ? "YES\n" : "NO\n");
        }
    }
}