#include <bits/stdc++.h>
using namespace std;
int n, x, Max, Min, ans;
char c[100005];
int f[100005], g[100005], d[100005], p[100005], q[100005];
int S1, S2, m, W, R, tot;
bool flag;
int main() {
  scanf("%d %d\n", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%c%d\n", &c[i], &d[i]);
    if (c[i] == '-') {
      S1++;
      f[d[i]]++;
      q[++tot] = d[i];
    } else {
      S2++;
      g[d[i]]++;
    }
  }
  sort(q + 1, q + tot + 1);
  for (int i = 1; i <= tot; ++i)
    if (q[i] != q[i - 1]) R++;
  if (n == 1) {
    cout << "Truth" << endl;
    return 0;
  }
  for (int i = 1; i <= n; ++i) {
    if (c[i] == '+') {
      if (f[d[i]] >= m + 1)
        p[i] = 1;
      else if (g[d[i]] >= m + 1)
        p[i] = 2;
      else if (R - (f[d[i]] > 0))
        p[i] = 2;
      else if (S1 == n - 1 && n != 2)
        p[i] = 1;
      else {
        p[i] = 0;
        W++;
      }
    } else {
      if (g[d[i]] >= m + 1)
        p[i] = 1;
      else if (f[d[i]] >= m + 1)
        p[i] = 2;
      else if (g[d[i]] == n - 1 && n != 2)
        p[i] = 1;
      else {
        p[i] = 0;
        W++;
      }
    }
    if (p[i] == 1) m--;
  }
  if (W == m)
    flag = true;
  else
    flag = false;
  for (int i = 1; i <= n; ++i)
    if (p[i] == 1 || p[i] == 0 && flag)
      printf("Truth\n");
    else if (p[i] == 2)
      printf("Lie\n");
    else
      printf("Not defined\n");
  return 0;
}
