/* Problem URL: https://codeforces.com/contest/2021/problem/C2 */

#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;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n, m, q;
    cin >> n >> m >> q;

    vi var(n);
    V<set<int>> p(n);
    rep(i, n) {
        int x;
        cin >> x;
        var[x - 1] = i;
        p[i].insert(oo);
    }

    vi b(m);
    rep(i, m) {
        cin >> b[i];
        b[i]--;
        p[var[b[i]]].insert(i);
    }

    vi df(n - 1);
    int c = 0;
    rep(i, n - 1) {
        df[i] = *p[i + 1].begin() - *p[i].begin();
        c += df[i] < 0;
    }

    string ans[] = {
        "TIDAK",
        "YA"
    };

    cout << ans[c == 0] << '\n';

    auto rem = [&](int i) {
        if (i < n - 1 && df[i] < 0) {
            c--;
        }

        if (i > 0 && df[i - 1] < 0) {
            c--;
        }
    };

    auto add = [&](int i) {
        if (i < n - 1) {
            df[i] = *p[i + 1].begin() - *p[i].begin();
            c += df[i] < 0;
        }

        if (i > 0) {
            df[i - 1] = *p[i].begin() - *p[i - 1].begin();
            c += df[i - 1] < 0;
        }
    };

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

        int bf = b[i];
        b[i] = j;
        j = var[j];
        bf = var[bf];
        rem(bf);
        p[bf].erase(i);
        add(bf);
        rem(j);
        p[j].insert(i);
        add(j);

        cout << ans[c == 0] << '\n';
    }
}

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

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}