#include <bits/stdc++.h>
using namespace std;
int arr[100004], wh[100004];
int conv(string s) {
  string n = s.substr(1);
  stringstream ss(n);
  int m;
  ss >> m;
  if (s[0] == '+') return m;
  return -1 * m;
}
int main() {
  int N, M;
  cin >> N >> M;
  int cnt = 0;
  string s;
  for (int i = 0; i < N; ++i) {
    cin >> s;
    int n = conv(s);
    if (n > 0) {
      arr[n]++;
      wh[i + 1] = n;
    } else {
      cnt++;
      arr[-1 * n]--;
      wh[i + 1] = n;
    }
  }
  vector<int> V;
  for (int i = 1; i <= N; ++i) {
    int tot = cnt + arr[i];
    if (tot == M) V.push_back(i);
  }
  sort(V.begin(), V.end());
  for (int i = 1; i <= N; ++i) {
    if (wh[i] > 0) {
      bool f = binary_search(V.begin(), V.end(), wh[i]);
      if (!f) {
        cout << "Lie" << endl;
      } else {
        if (V.size() == 1) {
          cout << "Truth" << endl;
        } else
          cout << "Not defined" << endl;
      }
    } else {
      bool f = binary_search(V.begin(), V.end(), -1 * wh[i]);
      if (f) {
        if (V.size() == 1) {
          cout << "Lie" << endl;
        } else
          cout << "Not defined" << endl;
      } else {
        cout << "Truth" << endl;
      }
    }
  }
}
