#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
int N, M;
vector<int> ps[100001];
vector<int> ms[100001];
int pSize, mSize;
pair<int, int> ary[100001];
int anss[100001];
string resStr[] = {"Truth", "Not defined", "Lie"};
int main() {
  memset(anss, -1, sizeof(anss));
  cin >> N >> M;
  for (int i = 0; i < N; i++) {
    char code;
    int num;
    cin >> code >> num;
    ary[i].first = num;
    if (code == '+') {
      ary[i].second = 1;
      ps[num].push_back(i);
      pSize++;
    } else {
      ms[num].push_back(i);
      ary[i].second = -1;
      mSize++;
    }
  }
  set<int> st;
  for (int i = 0; i < N; i++) {
    int tCnt = (int)ps[i + 1].size();
    tCnt += mSize - (int)ms[i + 1].size();
    if (tCnt == M) st.insert(i + 1);
  }
  for (set<int>::iterator it = st.begin(); it != st.end(); it++) {
    int a = *it;
    for (int i = 0; i < (int)ps[a].size(); i++) {
      anss[ps[a][i]] = (int)st.size() == 1 ? 0 : 1;
    }
  }
  for (int i = 1; i <= N; i++) {
    for (int j = 0; j < (int)ps[i].size(); j++) {
      if (anss[ps[i][j]] != -1) continue;
      anss[ps[i][j]] = 2;
    }
  }
  for (set<int>::iterator it = st.begin(); it != st.end(); it++) {
    int a = *it;
    for (int i = 0; i < (int)ms[a].size(); i++)
      anss[ms[a][i]] = (int)st.size() == 1 ? 2 : 1;
  }
  for (int i = 1; i <= N; i++) {
    for (int j = 0; j < (int)ms[i].size(); j++) {
      if (anss[ms[i][j]] != -1) continue;
      anss[ms[i][j]] = 0;
    }
  }
  for (int i = 0; i < N; i++) {
    cout << resStr[anss[i]] << endl;
  }
  return 0;
}
