#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 20;
int n, m, a[MAXN], isC[MAXN], res[MAXN], cnt, resF;
int check() {
  for (int i = 0; i < n; i++)
    if (isC[i] == m) {
      cnt++;
    }
  if (cnt * m == m && m > 0) return 1;
  return -1;
}
int notDef() {
  int cntP = 0, cntM = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > 0)
      cntP++;
    else
      cntM++;
  }
  if (cntP == n || cntM == n) return 1;
  return -1;
}
void cal() {
  resF = check();
  if (notDef() == -1) {
    if (m == 0)
      for (int i = 0; i < n; i++) res[i] = -1;
    else if (resF == -1 && cnt < n)
      for (int i = 0; i < n; i++)
        if (isC[a[i] - 1] == m)
          res[i] = -1;
        else if (resF == 1)
          for (int i = 0; i < n; i++) {
            if (isC[a[i] - 1] == m)
              res[i] = 1;
            else
              res[i] = -1;
          }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] > 0) isC[a[i] - 1]++;
  }
  cal();
  for (int i = 0; i < n; i++) {
    if (res[i] == 1)
      cout << "Truth\n";
    else if (res[i] == -1)
      cout << "Lie\n";
    else
      cout << "Not defined\n";
  }
  return 0;
}
