#include <bits/stdc++.h>
using namespace std;
const int maxn = 1020;
const int maxt = 100200;
const int INF = 0x3f3f3f3f;
const int mod = 1e4 + 7;
const double pi = acos(-1.0);
int n, k;
int a[100010];
int t1[100010], t2[100010];
map<int, int> ma;
int main() {
  while (~scanf("%d%d", &n, &k)) {
    int cnt = 0;
    ma.clear();
    memset(t1, 0, sizeof t1);
    memset(t2, 0, sizeof t2);
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &a[i]);
      if (a[i] < 0) {
        cnt++;
        t1[-a[i]]++;
      } else {
        t2[a[i]]++;
      }
    }
    int tt = 0, pos;
    for (int i = 1; i <= n; ++i) {
      int m = t2[i] + cnt - t1[i];
      if (m == k) {
        pos = i;
        ma[i] = 1;
        tt++;
      }
    }
    if (tt == 1) {
      for (int i = 1; i <= n; ++i) {
        if (a[i] < 0) {
          if (a[i] == -pos)
            printf("Line\n");
          else
            printf("Truth\n");
        } else {
          if (a[i] == pos)
            printf("Truth\n");
          else
            printf("Line");
        }
      }
    } else {
      for (int i = 1; i <= n; ++i) {
        int t = abs(a[i]);
        if (ma[t]) {
          printf("Not defined\n");
        } else {
          if (a[i] > 0)
            printf("Line\n");
          else
            printf("Truth\n");
        }
      }
    }
  }
  return 0;
}
