1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

vector<int> sum(vector<int> &pierwszy, vector<int> &drugi) {
  vector<int> result = pierwszy;
  for (auto i : drugi) {
    bool znal = false;
    for (auto d : pierwszy) {
      if (i == d) {
        znal = true;
        break;
      }
    }
    if (!znal) {
      result.push_back(i);
    }
  }
  sort(result.begin(), result.end());
  return result;
}

vector<int> neg(vector<int> &pierwszy, vector<int> &drugi) {
  vector<int> temp;
  for (auto i : pierwszy) {
    bool znal = false;
    for (auto d : drugi) {
      if (i == d) {
        znal = true;
        break;
      }
    }
    if (!znal) {
      temp.push_back(i);
    }
  }
  sort(temp.begin(), temp.end());
  return temp;
}

vector<int> split(vector<int> &pierwszy, vector<int> &drugi) {
  vector<int> temp;

  for (auto i : pierwszy) {
    for (auto d : drugi) {
      if (i == d) {
        temp.push_back(i);
      }
    }
  }
  return temp;
}

string find(vector<int> &tablica, int v) {
  for (auto i : tablica) {
    if (i == v) {
      return "TAK";
    }
  }
  return "NIE";
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, q;
  vector<vector<int>> tablice;
  cin >> n >> m >> q;

  for (int i = 1; i <= n; ++i) {
    tablice.push_back({});
    for (int d = i; d <= n; ++d) {
      if (d % i == 0) {
        tablice[i - 1].push_back(d);
      }
    }
  }

  for (int i = 0; i < m; ++i) {
    int typ, x, y;
    cin >> typ;
    switch (typ) {
    case 1:
      cin >> x >> y;
      tablice.push_back(sum(tablice[x - 1], tablice[y - 1]));
      break;
    case 2:
      cin >> x >> y;
      tablice.push_back(split(tablice[x - 1], tablice[y - 1]));
      break;
    case 3:
      cin >> x;
      tablice.push_back(neg(tablice[0], tablice[x - 1]));
      break;
    }
  }

  for (int i = 0; i < q; ++i) {
    int x, v;
    cin >> x >> v;
    cout << find(tablice[x - 1], v) << "\n";
  }

  return 0;
}