#include <bits/stdc++.h>
using namespace std;
void one_case() {
  int n, m;
  cin >> n >> m;
  vector<int> pos(n), neg(n);
  vector<pair<char, int>> ans;
  int tp = 0, tn = 0;
  for (int i = 0; i < n; ++i) {
    char s;
    int a;
    cin >> s >> a;
    --a;
    if (s == '+') {
      ++pos[a];
      ++tp;
    } else {
      ++neg[a];
      ++tn;
    }
    ans.emplace_back(s, a);
  }
  set<int> cand;
  for (int i = 0; i < n; ++i) {
    int lied = neg[i] + tp - pos[i];
    if (lied == n - m) {
      cand.insert(i);
    }
  }
  if (cand.size() != 1) {
    for (int i = 0; i < n; ++i) {
      auto [s, a] = ans[i];
      if (cand.count(a)) {
        cout << "Not defined\n";
      } else {
        if (s == '-') {
          cout << "Truth\n";
        } else {
          cout << "Lie\n";
        }
      }
    }
  } else {
    for (int i = 0; i < n; ++i) {
      auto [s, a] = ans[i];
      if (cand.count(a)) {
        if (s == '+') {
          cout << "Truth\n";
        } else {
          cout << "Lie\n";
        }
      } else {
        if (s == '-') {
          cout << "Truth\n";
        } else {
          cout << "Lie\n";
        }
      }
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int t = 1;
  while (t--) {
    one_case();
  }
  return 0;
}
