#include <bits/stdc++.h>
using namespace std;
int n, m;
const int nm = 100 * 1000 + 50;
int b[nm][2];
int v[nm];
set<int> cor;
int main() {
  cin >> n >> m;
  int S = 0;
  for (int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    a = -a;
    v[i] = a;
    if (a > 0) {
      b[a][0]++;
      S++;
    } else {
      b[-a][1]++;
    }
  }
  for (int i = 1; i <= n; i++) {
    int C = S - b[i][0] + b[i][1];
    if (C == m) cor.insert(i);
  }
  for (int i = 1; i <= n; i++) {
    bool t = false, f = false;
    if (v[i] < 0) {
      if (cor.count(-v[i]) > 0) t = true;
      if (cor.size() > 1) f = true;
    } else {
      if (cor.count(v[i]) > 0) f = true;
      if (cor.size() > 1) t = true;
    }
    if (f && t)
      cout << "Not defined\n";
    else if (f)
      cout << "Lie\n";
    else if (t)
      cout << "Thruth\n";
  }
  return 0;
}
