func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e5 + 5;   const double eps = 1e-8;   const int mod = 1e9 + 7;   int jia[N], jian[N], x[N], yes[N];   int out[N][3];   int abbs(int x) {     if (x > 0)       return x;     else       return -x;   }   int main() {     int n, m, t;     scanf( %d%d , &n, &m);     memset(out, 0, sizeof(out));     memset(yes, 0, sizeof(yes));     memset(jia, 0, sizeof(jia));     memset(jian, 0, sizeof(jian));     int alljia = 0, alljian = 0, all = 0;     for (int i = 1; i <= n; i++) {       scanf( %d , &x[i]);       if (x[i] > 0)         jia[x[i]]++, alljia++;       else         jian[-x[i]]++, alljian++;     }     for (int i = 1; i <= n; i++) {       int numzhen = jia[i] + alljian - jian[i];       if (numzhen == m) {         yes[i] = 1;         all++;       }     }     for (int i = 1; i <= n; i++) {       int xx = abbs(x[i]);       if (yes[xx]) {         if (all == 1) {           if (x[i] > 0)             out[i][0] = 1;           else             out[i][1] = 1;         } else {           out[i][2] = 1;         }       } else {         if (x[i] > 0)           out[i][1] = 1;         else           out[i][0] = 1;       }     }     for (int i = 1; i <= n; i++) {       if (out[i][2])         printf( Not defined n );       else if (out[i][0])         printf( Truth n );       else if (out[i][1])         printf( Lie n );     }     return 0;   }   