#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
long long Factorial(long long i) { return i > 1 ? i * Factorial(i - 1) : 1; }
long long Combination(long long n, long long r) {
  if (n - r < r) r = n - r;
  long long ansn = 1, ansr = 1;
  for (long long i = n - r + 1; i <= n; ++i) ansn *= i;
  for (long long j = 1; j <= r; ++j) ansr *= j;
  return ansn / ansr;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
std::vector<int> Eratosthenes(const int len, int *vis) {
  memset(vis, 0, sizeof(int) * len);
  std::vector<int> prime;
  int m = (int)sqrt(len + 0.5);
  for (int i = (2); i <= (m); ++i)
    if (!vis[i])
      for (int j = i * i; j < len; j += i) vis[j] = 1;
  for (int i = (2); i < (len); ++i)
    if (!vis[i]) prime.push_back(i);
  return prime;
}
void phi_table(int n, int *phi) {
  for (int i = (2); i <= (n); ++i) phi[i] = 0;
  phi[1] = 1;
  for (int i = (2); i <= (n); ++i)
    if (!phi[i])
      for (int j = i; j <= n; j += i) {
        if (!phi[j]) phi[j] = j;
        phi[j] = phi[j] / i * (i - 1);
      }
}
const int maxn = 1e5 + 10;
std::vector<int> yes[maxn], no[maxn];
int n, m, tmp, num, in[maxn];
char s[maxn];
bool vis[maxn];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (0); i < (n); ++i) {
    scanf(" %c%d", s + i, in + i);
    char &c = s[i];
    int &t = in[i];
    if (c == '+') {
      yes[t].push_back(i);
    } else {
      no[t].push_back(i);
      ++tmp;
    }
  }
  for (int i = (0); i <= (n); ++i)
    if (yes[i].size() + tmp - no[i].size() == m) {
      vis[i] = true;
      ++num;
    }
  if (!num) {
  }
  if (m == 0) {
    for (int i = (0); i < (n); ++i) printf("Lie\n");
    return 0;
  }
  for (int i = (0); i < (n); ++i) {
    if (s[i] == '+') {
      if (vis[in[i]]) {
        if (num > 1)
          printf("Not defined\n");
        else
          printf("Truth\n");
      } else
        printf("Lie\n");
    } else {
      if (!vis[in[i]])
        printf("Truth\n");
      else if (num == 1)
        printf("Lie\n");
      else
        printf("Not defined\n");
    }
  }
  return 0;
}
