#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
const int maxN = 100500;
int to[maxN];
int a[maxN];
int b[maxN];
int cand[maxN];
int main() {
  int n, m;
  cin >> n >> m;
  int B = 0;
  int A = 0;
  for (int i = 1; i <= n; i++) {
    cin >> to[i];
    if (to[i] > 0) {
      a[to[i]]++;
      A++;
    } else {
      B++;
      b[-to[i]]++;
    }
  }
  int cands = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] + B - b[i] == m) {
      cand[i] = 1;
      cands++;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (to[i] > 0) {
      if (cand[to[i]] && cands == 1) {
        cout << "Truth" << endl;
      } else if (cand[to[i]]) {
        cout << "Not defined" << endl;
      } else {
        cout << "Lie" << endl;
      }
    } else {
      if (!cand[-to[i]]) {
        cout << "Truth" << endl;
      } else if (cands >= 2) {
        cout << "Not defined" << endl;
      } else {
        cout << "Lie" << endl;
      }
    }
  }
  return 0;
}
