#include <bits/stdc++.h>
using namespace std;
char ch[200001];
map<int, int> lozh, prav;
int n, m, x, t, tp, sch = 1, c, a[200001];
bool d[200001];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    cin >> ch[i];
    cin >> a[i];
    if (ch[i] == '+') {
      lozh[a[i]]++;
      t++;
    } else {
      prav[a[i]]++;
      tp++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (lozh[i] + tp - prav[i] == m && prav[i] + t - lozh[i] == n - m) {
      d[i] = true;
      c++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if ((d[a[i]] == true && ch[i] == '-' && c == 1) ||
        (!d[a[i]] && ch[i] == '+'))
      printf("Lie\n");
    else {
      if (d[a[i]] == true && c > 1)
        printf("Not defined\n");
      else
        printf("Truth\n");
    }
  }
}
