#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return n & two(b); }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T& a, const T& b) {
  a = max(a, b);
}
template <class T>
void chmin(T& a, const T& b) {
  a = min(a, b);
}
const int MAX = 100001;
int N, M, K;
int criminal[MAX], a[MAX], b[MAX];
pair<int, int> graph[MAX];
int main() {
  scanf("%d%d", &N, &M);
  int B = 0;
  for (int i = 0; i < (N); i++) {
    char c;
    int n;
    scanf(" %c%d", &c, &n);
    --n;
    if (c == '+')
      ++a[n];
    else
      ++b[n], ++B;
    graph[i] = make_pair(n, c == '+' ? 1 : -1);
  }
  for (int i = 0; i < (N); i++)
    if (a[i] + B - b[i] == M) {
      ++K;
      criminal[i] = 1;
    }
  for (int i = 0; i < (N); i++) {
    pair<int, int> temp = graph[i];
    int state = 0;
    if (temp.second == 1) {
      if (criminal[temp.first]) state |= 1;
      if (K > 1) state |= 2;
    } else {
      if (criminal[temp.first]) state |= 2;
      if (K > 1) state |= 1;
    }
    if (state == 1)
      printf("Truth\n");
    else if (state == 2)
      printf("Lie\n");
    else
      printf("Not defined\n");
  }
  return 0;
}
