// Om Namah Shivaya
#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<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n, q; cin >> n >> q;
ll a[3][n + 5], pos[3][n + 5];
rep(j, 3) {
rep1(i, n) {
cin >> a[j][i];
pos[j][a[j][i]] = i;
}
}
while (q--) {
ll t; cin >> t;
if (t == 1) {
ll s; cin >> s;
queue<ll> q;
q.push(s);
vector<bool> vis(n + 5);
vis[s] = 1;
while (!q.empty()) {
ll i = q.front();
q.pop();
rep(j, 3) {
ll p = pos[j][i];
if (p + 1 <= n) {
ll v = a[j][p + 1];
if (!vis[v]) {
vis[v] = 1;
q.push(v);
}
}
}
}
ll cnt = count(all(vis), 1);
if (cnt == n) {
cout << "DA" << endl;
}
else {
cout << "NE" << endl;
}
}
else {
ll j, x, y; cin >> j >> x >> y;
j--;
ll p1 = pos[j][x], p2 = pos[j][y];
swap(a[j][p1], a[j][p2]);
swap(pos[j][x], pos[j][y]);
}
}
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
