#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
vector<int> G1[N], G2[N];
int id[N];
bool flag[N];
int main() {
  int n, m;
  while (scanf("%d %d", &n, &m) != EOF) {
    memset(flag, 0, sizeof(flag));
    memset(id, 0, sizeof(id));
    memset(G1, 0, sizeof(G1));
    memset(G2, 0, sizeof(G2));
    getchar();
    int cnt1 = 0, cnt2 = 0;
    char ch;
    int tmp;
    for (int i = 1; i <= n; i++) {
      scanf("%c%d", &ch, &tmp);
      getchar();
      if (ch == '+') {
        G1[tmp].push_back(i);
        cnt1++;
      } else {
        G2[tmp].push_back(i);
        cnt2++;
      }
    }
    vector<int> crimal;
    for (int i = 1; i <= n; i++) {
      int truth = G1[i].size() + (cnt2 - G2[i].size());
      if (truth == m) {
        flag[i] = 1;
        crimal.push_back(i);
      }
    }
    if (crimal.size() == 1) {
      int u = crimal[0];
      for (int i = 0; i < G1[u].size(); i++) id[G1[u][i]] = 1;
      for (int i = 1; i <= n; i++)
        if (i != u)
          for (int j = 0; j < G2[i].size(); j++) id[G2[i][j]] = 1;
    } else {
      for (int i = 1; i <= n; i++) {
        if (flag[i]) {
          for (int k = 0; k < G1[i].size(); k++) id[G1[i][k]] = 2;
          for (int k = 0; k < G2[i].size(); k++) id[G2[i][k]] = 2;
        } else {
          for (int k = 0; k < G1[i].size(); k++) id[G1[i][k]] = 0;
          for (int k = 0; k < G2[i].size(); k++) id[G2[i][k]] = 1;
        }
      }
    }
    for (int i = 1; i <= n; i++) {
      if (id[i] == 0)
        printf("Lie\n");
      else if (id[i] == 1)
        printf("Truth\n");
      else
        printf("Not defined\n");
    }
  }
  return 0;
}
