func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long int INF = 2e18;   bool isPrime(long long int n) {     if (n <= 1) return false;     if (n <= 3) return true;     if (n % 2 == 0 || n % 3 == 0) return false;     for (long long int i = 5; i * i <= n; i = i + 6) {       if (n % i == 0 || n % (i + 2) == 0) return false;     }     return true;   }   long long int exp(long long int x, long long int n) {     long long int res = 1;     while (n > 0) {       if (n % 2 == 1) res = (res * x) % 1000000007;       x = (x * x) % 1000000007;       n = n / 2;     }     return res;   }   void null() {     long long int n, l, r;     cin >> n >> l >> r;     vector<long long int> a, b;     for (long long int i = 0; i < n; i++) {       long long int x;       cin >> x;       a.push_back(x);     }     for (long long int i = 0; i < n; i++) {       long long int x;       cin >> x;       b.push_back(x);     }     for (long long int i = 0; i < l - 1; i++) {       if (a[i] != b[i]) {         cout <<  LIE ;         return;       }     }     for (long long int i = r; i < n; i++) {       if (a[i] != b[i]) {         cout <<  LIE ;         return;       }     }     cout <<  TRUTH ;   }   signed main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long int t = 1;     clock_t start, end;     start = clock();     cout << fixed << setprecision(20);     while (t--) {       null();     }     end = clock();     double time_taken = double(end - start) / double(CLOCKS_PER_SEC);   }   