#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <class T>
double sqrt(T x) {
  return sqrt((double)x);
}
int phi(int n) {
  int res = n;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        n /= i;
      }
      res -= res / i;
    }
  }
  if (n > 1) {
    res -= res / n;
  }
  return res;
}
int power(int a, int n) {
  if (n == 0) {
    return 1;
  } else {
    if (n % 2 == 0) {
      return power(a, n / 2) * power(a, n / 2);
    } else {
      return a * power(a, n - 1);
    }
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> mas(n);
  vector<char> zapro(n);
  for (int i = 0; i < n; i++) {
    cin >> zapro[i];
    cin >> mas[i];
  }
  int k = 0;
  for (int i = 0; i < n; i++) {
    if (zapro[i] == '+') {
      k++;
    }
  }
  vector<int> obvi(n, 0);
  vector<int> opra(n, 0);
  for (int i = 0; i < n; i++) {
    if (zapro[i] == '+') {
      obvi[mas[i] - 1]++;
    } else {
      opra[mas[i] - 1]++;
    }
  }
  int t = 0;
  for (int i = 0; i < n; i++) {
    if (obvi[i] + (n - k) - opra[i] == m) {
      t++;
    }
  }
  if (t == 1) {
    for (int i = 0; i < n; i++) {
      if (obvi[i] + (n - k) - opra[i] == m) {
        for (int j = 0; j < n; j++) {
          if ((zapro[j] == '+' && mas[j] == i + 1) ||
              (zapro[j] == '-' && mas[j] != i + 1)) {
            cout << "Truth" << endl;
          } else {
            cout << "Lie" << endl;
          }
        }
      }
    }
  } else {
    vector<string> buf(n, "Lie");
    for (int i = 0; i < n; i++) {
      if (obvi[i] + (n - k) - opra[i] == m) {
        for (int j = 0; j < n; j++) {
          if ((zapro[j] == '+' && mas[j] == i + 1) ||
              (zapro[j] == '-' && mas[j] != i + 1)) {
            buf[j] = "Not defined";
          }
        }
      }
    }
    for (int i = 0; i < n; i++) {
      cout << buf[i] << endl;
    }
    return 0;
  }
  return 0;
}
