#include <bits/stdc++.h>   using namespace std;   vector<string> v;   string s;   const int N = 1000001;   int n;   long long d, arr[N];   unsigned long long gcd(long long x, long long y) {     if (y == 0) {       return x;     }     return gcd(y, x % y);   }   void gen(long long ind, string t) {     if (ind == s.size()) {       if (t.size() == 3) v.push_back(t);       return;     }     gen(ind + 1, t + s[ind]);     gen(ind + 1, t);   }   long long check() {     long long res = 0;     for (long long i = 0; i < v.size(); ++i) {       if (((v[i][v[i].size() - 1] -  0 ) - (v[i][0] -  0 )) <= d) {         res++;       }     }     return res;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     int n, l, r;     bool lie = 0;     cin >> n >> l >> r;     int v[n], s[n];     for (int i = 1; i <= n; ++i) {       cin >> v[i];     }     for (int i = 1; i <= n; ++i) {       cin >> s[i];     }     for (int i = 1; i < l; ++i) {       if (v[i] != s[i]) {         lie = 1;         break;       }     }     if (!lie) {       for (int i = r + 1; i <= n; ++i) {         if (v[i] != s[i]) {           lie = 1;           break;         }       }     }     if (lie) {       cout <<  LIE n ;     } else {       cout <<  TRUTH n ;     }     return 0;   }   